计算理论之二.pdfVIP

Introduction to the Theory of Computation Lecture 2: Concrete Mathematics Sep. 27 Concrete Mathematics: A Foundation for Computer Science Ronald L. Graham, Donald E. Knuth, and Oren Patashnik Addison-Wesley Professional 2nd Edition, 1994 Introduction to the Theory of Computation 2 Introduction to the Theory of Computation Lecture 2-1: Recurrent Problems Sep. 27 Recurrent Problems The tower of HANOI Lines in the Plane The Josephus Problem Introduction to the Theory of Computation 4 The Tower of HANOI Invented by Edouard Lucas, 1883 Objective: Transfer the entire tower to one of the other pegs Rules Moving only one disk at a time, And never moving a larger one onto a smaller. Introduction to the Theory of Computation 5 Looking at small case T = 1 1 T = 3 2 T = 0 0 Introduction to the Theory of Computation 6 How to transfer a larger tower? Steps in general 1) transfer the n-1 smallest to a different peg (requiring moves)Tn − 1 2) move the largest (require one move) 3) finally transfer the n-1 smallest back onto the largest (requiring another T n − 1 moves) T ≤ 2 T + 1 n n − 1 Introduction to the Theory of Computation 7 General formula T = 0 0 T = 2T + 1 n n−1 How to get its closed forms? Introduction to the Theory of Computation 8 How to solve the recurrence? (1) T =