1. cs3102: Theory of Computation Class 17: Undecidable Languages Spring 2010 University of Virginia David Evans

2. Menu Another S ELF -R EJECTING argument: diagonalization A language that is Turing-recognizable but not Turing-decidable Ed Clarke, 2007 Turing Award Barbara Liskov, 2008 Turing Award Monday, March 29 3:30pm in MEC 205 Thursday, April 1 2:00pm in Chemistry

3. Yes? Contradiction! No? Contradiction! The assumption leads to a contradiction: thus, M SR must not exist!

4. Alternate Proof  0100011011000001010… M()M() … M(0) … M(1) M(00) M(01) M(10) M(11) M(000) … M(w)M(w) … Input Machine Which of the machines are in S ELF -R EJECTING ?

5. Alternate Proof  0100011011000001010… M()M() … M(0) … M(1) M(00) M(01) M(10) M(11) M(000) … M(w)M(w) … Input Machine Where is w SR ?

6. s Languages that can be recognized by any mechanical computing machine All Languages S ELF -R EJECTING

7. s Turing-Recognizable All Languages S ELF -R EJECTING Turing-Decidable Context-Free

8. Recognizing vs. Deciding Turing-recognizable: A language L is “Turing- recognizable” if there exists a TM M such that for all strings w : – If w  L : eventually M enters q accept. – If w  L : either M enters q reject or M never terminates. Turing-decidable: A language L is “Turing-decidable” if there exists a TM M such that for all strings w : – If w  L : eventually M enters q accept. – If w  L : eventually M enters q reject.

9. Detour: Exam Revisions

10. Proof that SF is not CFL Contradiction means one of the two assumptions must be false, but we don’t know which!

11. Is SF Context-Free?

12. Squarefree Sequences in {a, b, c}* There are infinitely long squarefree sequences with at least 3 alphabet symbols Some interesting applications and lots of interesting efficient ways to generate them Ron Rivest’s paper If you solved PS4 question 2 do you know an inefficient way?

13. Proving Recognizability How do we prove a language is Turing-recognizable? How do we prove a language is Turing-decidable? How do we prove a language is not Turing-decidable?

14. Accepted by TM Is this language Turing-recognizable?

15. Accepted by TM Is this language Turing-recognizable? Can we really do this? Universal Turing Machine: a TM that can simulate every other TM.

16. Universal Turing Machine Universal Turing Machine w Output of running M starting on tape w

17. Manchester Illuminated Universal Turing Machine, #9 from http://www.verostko.com/manchester/manchester.html

18. Universal Turing Machines Universal Turing Machines designed with: – 4 symbols, 7 states (Marvin Minsky) – 4 symbols, 5 states – 2 symbols, 22 states – 18 symbols, 2 states – 2 states, 5 symbols (Stephen Wolfram)

19. 2-state, 3-symbol Universal TM Sequence of configurations

20. Of course, simplicity is in the eye of the beholder. The 2,3 Turing machine described in the dense new 40-page proof “chews up a lot of tape” to perform even a simple job, Smith says. Programming it to calculate 2 + 2, he notes, would take up more memory than any known computer contains. And image processing? “It probably wouldn't finish before the end of the universe,” he says. Alex Smith, University of Birmingham

21. Rough Sketch of Proof System 0 (the claimed UTM) can simulate System 1 which can simulate System 2 which can simulate System 3 which can simulate System 4 which can simulate System 5 which can simulate any 2-color cyclic tag system which can simulate any TM. See http://www.wolframscience.com/prizes/tm23/TM23Proof.pdfhttp://www.wolframscience.com/prizes/tm23/TM23Proof.pdf for the 40-page version with all the details… See http://www.wolframscience.com/prizes/tm23/TM23Proof.pdfhttp://www.wolframscience.com/prizes/tm23/TM23Proof.pdf for the 40-page version with all the details… None of these steps involve universal computation themselves

22. Accepted by TM Is this language Turing-decidable?

23. Proof that A TM is Undecidable

26. Both are contractions! So, D must not exist. But, if H exists, we can make D. So, H must not exist! But, if A TM is decidable, H must exist. Thus, A TM must not be decidable.

27. s Turing-Recognizable All Languages S ELF -R EJECTING Turing-Decidable Context-Free A TM

28. Halting Problem

29. Halting Problem is Undecidable

31. HALTSANY

32. Crashes Any equivalent to a TM enters some bad state

33. Edmund M. Clarke, The Birth of Model Checking

34. Model Checking in Theory Model Checking is Undecidable. Impossible to write a program that answers this correctly for all inputs.

35. Model Checking in Practice

36. Monday’s Talk Model Checking: My 27 year Quest to Overcome the State Explosion Problem MEC 205, 3:30pm (cookies after talk) Edmund Clarke 2007 Turing Award Winner (with Allen Emerson, Joseph Sifakis)

37. Return PS4 and Exam Revisions