1 / 26

Languages Accepted by Turing Machines

a/R. a/B. B/R. b/R. B/R. B/L. a/L. b/L. B/L. b/B. b/L. Languages Accepted by Turing Machines. Example 2: Language L = {a [n] b [n] | n > 0} on the alphabet {a, b}. q 1. q 2. q 3. q 8. q 6. q 5. q 4. B/B. q 7. a/R. a/B. B/R. b/R. B/R. B/L. a/L. b/L. B/L. b/B. b/L.

abarret
Download Presentation

Languages Accepted by Turing Machines

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. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  2. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BaabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  3. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  4. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  5. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  6. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  7. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  8. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabbB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  9. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  10. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  11. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  12. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  13. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBabBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  14. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBbBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  15. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBbBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  16. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBbBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  17. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBbBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  18. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBBBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  19. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 q8 q6 q5 q4 …BBBBBB… ↑ B/B q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  20. a/R a/B B/R b/R B/R B/L a/L b/L B/L b/B b/L Languages Accepted by Turing Machines Example 2: Language L = {a[n]b[n] | n > 0} on the alphabet {a, b}. q1 q2 q3 Accept! q8 q6 q5 q4 …BBBBBB… ↑ q7 Introduction to Cognitive Science Lecture 15: Theory of Computation II

  21. TMs as Computers So what languages can Turing machines accept? This class of languages is called the recursively enumerable languages. For example, it includes the language L = {a[n]b[n] | n > 0}, which is not a regular language. This shows that the unlimited memory leads to increased computational capabilities. But what about the functions that Turing machines can compute? (After the TM halts, the symbols on the tape can be regarded as the output of the TM, or the result of the function it computes.) Introduction to Cognitive Science Lecture 15: Theory of Computation II

  22. Church’s Thesis Church’s thesis: Any function that can be algorithmically computed can also be computed by a Turing machine. Why is it only a thesis? There is no general mathematical definition of algorithm – it is always specific to a particular scheme, i.e., a programming language. Therefore, Church’s thesis cannot be proved. However, no counterexample has been found, and no scientist seriously doubts that Church’s thesis is correct. Introduction to Cognitive Science Lecture 15: Theory of Computation II

  23. The Halting Problem Are there any functions that cannot be computed? Yes! The most famous of those is the halting problem. Let us enumerate all possible Turing machines, i.e., give them numbers 1, 2, 3, … Then the function HALT(x, y) is true if Turing machine y terminates when given input x, and is false otherwise. Here comes a surprise: HALT(x, y) is not a computable function. Introduction to Cognitive Science Lecture 15: Theory of Computation II

  24. The Halting Problem Because of Church’s thesis, we can state the halting problem in a more general form: There exists no algorithm that can decide for any other algorithm whether its computation will ever halt for a given input. Introduction to Cognitive Science Lecture 15: Theory of Computation II

  25. The Halting Problem It may surprise you that there is no algorithm for solving the halting problem. But did we not assume that the Theory of Computation applies to all things that compute, including our brains? And is it not possible for a computer scientist to analyze a given program and find out whether it will terminate for a particular input or not (even if this analysis takes a very long time)? No, actually we can devise a very simple Turing machine or computer program for which to date nobody is able to tell whether it will ever terminate. Introduction to Cognitive Science Lecture 15: Theory of Computation II

  26. The Halting Problem This program is based on Goldbach’s conjecture, which assumes that every even number  4 is the sum of two prime numbers. For example, 4 = 2 + 2, 6 = 3 + 3, 48 = 41 + 7. It was first stated by Goldbach in 1742, and despite great efforts, nobody has ever been able to prove or disprove it. It would be easy to build a Turing machine or write a C, Java, or Basic program that searches for a counterexample to this conjecture. Nobody knows whether this program will ever halt. Introduction to Cognitive Science Lecture 15: Theory of Computation II

More Related