计算理论20110421y.pptVIP

* 计算理论导引与算法复杂性 Introduction to the Theory of Computation and Algorithm Complexities 主讲：刘国华 （学院楼①225室，ghliu@） 助教：辛婷婷 （学院楼①153室，xtt.moon@163.com） FTP: CHAPTER 3 ALGORITHEMS(2) THE HAITING PROBLEM(ACCEPTANCE PROBLEM) ATM={M,w|M is a TM and M accepts w} U=“On inputM,w,where M is a TM and w is a string: 1.Simulate M on input w. 2.If M ever enters its accept state, accept; if M ever enter its reject state, reject.” If M loops, what will we do? CHAPTER 3 ALGORITHEMS(2) THE HAITING PROBLEM(ACCEPTANCE PROBLEM) 1 THE DIAGONALIZATION METHOD 1)Correspondence:a function that is both one-to-one and onto. 2)Countable set: a set A is countable if either it is finite or it has the same size as N. THEOREM 3.8 R is incountable. PROOF IDEA. To show that no correspondence exists between N and R. METHOD:contradiction To construct a real number x whose ith fractional digit is different from f(i)’s,1?i?n. CHAPTER 3 ALGORITHEMS(2) n f(n) 1 3.14159? 2 55.55555? 3 0.12345? 4 0.50000? ? ? x=0. 2 1 1 1 ? CHAPTER 3 ALGORITHEMS(2) COROLLARY 3.1 Some language are not Turing-recognizable. PROOF IDEA 1)The set of all Turing machine is countable; 2)The set of all language is uncountable; (1)The set of all infinite binary sequences is uncountable; (2) The set of all language and the set of all infinite binary sequences are the same size. CHAPTER 3 ALGORITHEMS(2) 2 THE HAITING PROBLEM(ACCEPTANCE PROBLEM) ATM={M, w|M is a TM and M accepts w} THEORM 3.9 ATM is undecidable. PROOF IDEA accept if M accepts w H(M, w)= reject if M does not accept w D=“On input M, where M is a TM: 1. Run H on input M, M. 2.Output the opposite of what H output; that