计算理论(第五章).pptVIP

Outline The Church-Turing Thesis Universal Turing Machines The Halting Problem The Church-Turing Thesis Universal Turing Machine The Halting Problem Chapter VUndecidability Elements of the theory of computation Wu Fei Wufei@cs.zju.edu.cn Department of Computer Science and Technology Alonzo Church Born: 14 June 1903 in Washington, D.C., USADied: 11 Aug 1995 in Hudson, Ohio, USA Ph.D Princeton He had 31 doctoral students including Turing, Kleene, Kemeny and Smullyan. The Church-Turing Thesis Effective or mechanical method in logic and mathematics The method consists of a finite set of simple and precise instructions that are described with a finite number of symbols. The method will always produce the result in a finite number of steps. The method can in principle be carried out by a human being with only paper and pencil. The execution of the method requires no intelligence of the human being except that which is needed to understand and execute the instructions. The Church-Turing Thesis Universal Turing Machine How do we input another TM Universal Turing Machine How do we input another TM Universal Turing Machine How do we input another TM Solution Universal Turing Machine Universal Turing Machine Universal Turing Machine Example i=2;j=3 Universal Turing Machine Example Universal Turing Machine Universal Turing Machine Universal Turing Machine Universal Turing Machine Universal Turing Machine The Halting Problem What is the Halting Problem The Halting Problem Why do We care The Motivation The Halting Problem The Halting Problem Diagonal(diagonal) halts if and only if the call halts(diagonal,diagonal) returns “no”. In other words, it halts if and only if does not halt The Halting Problem Non-Recursive Language The Language H is not recursive; H is precisely the language semi-decided by universal Turing machine U and is recursively enumerable. Therefore, the class of recursive languages is a strict subset of the class of recursively enumerable