1 / 30

Introduction to Computability Theory

Introduction to Computability Theory. Lecture14: Recap Prof. Amos Israeli. Subjects. Regular languages – Finite automata. Context free languages – Stack automata. Decidable languages – Turing machines. Undecidability. Reductions. The Language Hierarchy. Non Turing recognizable Ex: .

garvey
Download Presentation

Introduction to Computability Theory

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction to Computability Theory Lecture14: Recap Prof. Amos Israeli

  2. Subjects • Regular languages – Finite automata. • Context free languages – Stack automata. • Decidable languages – Turing machines. • Undecidability. • Reductions.

  3. The Language Hierarchy Non Turing recognizable Ex: Turing recognizable Ex: RL-s Ex: CFL-s Ex: Decidable Ex:

  4. Regular Languages • Defined DFA-s and their languages. • Defined NFA-s and their languages. • Defined RE-s and their languages. • Showed all three are equivalent. • Proved the Pumping lemma and demonstrated its use to prove irregularity.

  5. Training Problem 1 Consider a. Show that L is regular. b. Present an RE for L.

  6. Proof a,b a,b a. Consider - a,b a,b - - - - a,b,

  7. Proof b. Consider

  8. Context Free Languages • Defined CFG-s and their languages. • Defined Stack automata and their languages. • Showed that the two classes are equivalent. • Proved the Pumping lemma for CFL-s and demonstrated its use to prove languages to be non CFL.

  9. Training Problem 2 Let Show that L is context free. Proof:

  10. Decidable Languages • Defined Turing machines, decidable languages and Turing recognizable languages. • Defined multi-tape TM-s and non deterministic TM-s, and showed their equivalence to ordinary TM-s. • Introduced the Church-Turing hypothesis.

  11. Training Problem 3 Consider a. Show that L is regular by presenting a DFA. b. Show that L is CF by presenting a PDA. c. Show that L is decidable by presenting a TM.

  12. Training Problem 3 Consider a. Show that L is regular by presenting a DFA. 0,1 0 0

  13. Training Problem 3 0,1 Consider b. Show that L is CF by presenting a PDA. 0 0

  14. Training Problem 3 0,1 Consider c. Show that L is decidable by presenting a TM.

  15. Undecidability • Defined Cardinality of sets. • Showed that the cardinality of the rational numbers is equal to . • Used Diagonalization to show that the cardinality of infinite binary sequences is not equal to .

  16. Undecidability (cont.) • Showed that the cardinality of Turing recognizable languages is equal to . • Showed that the cardinality of languages is larger than . • Concluded the existence of a non Turing recognizable language.

  17. Undecidability (cont.) • Defined and showed that it is undecidable.

  18. Reductions • Defined reductions. • Used reductions to prove that , , , , and many other problems are undecidable. • Defined mapping reductions.

  19. Training Problem 4 Consider the following problem: Show that is undecidable.

  20. Proof We show a reduction from to . Assume TM R is a decider for , let S=“On input where N is a TM 1. Let M be the TM rejecting all its inputs. 2. if R accepts (meaning ) - accept, otherwise reject.”

  21. Proof We conclude that S never loops and itaccepts iff . In other words: S is a decider for . Since is undecidable, we conclude that is also undecidable. QED Other practice problems: Prove by reduction from and from .

  22. Training Problem 5 Prove or disprove: a. If L is Turing recognizable then L is undecidable. Disprove: A Language L is Turing recognizable if there exists a TM, M, s.t. . If M, halts on every input then L is decidable. In other words: Every decidable language is also Turing recognizable.

  23. Training Problem 5 Prove or disprove: b. If a Turing machine moves its head only to the right then it must halt. Disprove:Present a state diagram of a TM that goes to the right forever.

  24. Training Problem 5 Prove or disprove: c. If a language A, is undecidable then its complement is also undecidable.

  25. Training Problem 5 Prove: Assume towards a contradiction that is decidable and let M be a TM deciding it. Consider TM M’ which is identical to M except that the accepting and rejecting states of M’ are switched. Clearly M’ accepts (rejects resp.) if and only if M rejects (accepts resp.), hence, M’ decides A, a contradiction. QED

  26. Training Problem 6 An ordinary Turing machine may either change its current cell or leave it unchanged. A changer is a TM that always changes its current cell. Show that every Turing recognizable language is recognizable by a changer TM.

  27. Proof Let L be a Turing recognizable language and let M be a TM recognizing L, namely . Let be M’s alphabet. Define a TM M’ whose alphabet is , where contains all the “barred” elements of . How should M’s transition function be changed in order to keep its functionality?

  28. Training Problem 7 Let Consider the following problem: Show that is Turing recognizable.

  29. Proof Consider the following TM: S=“On input where M,N are TM-s 1. Repeat 1.1 Run a single step of M on input w. 1.2 Run a single step of N on input w. 1.3 if either M or N accept - accept, if both reject - reject.”

  30. Proof We can conclude: QED

More Related