1 / 10

Introduction to Turing Machines

Introduction to Turing Machines. 0. 0. 1. 1. 0. 1. 1. 1. 1. 1. 1. 1. 0. 1. 1. 0. 1. 1. 0. 0. 0. The Turing Machine. 0. 1. 1. 0. 1. 0. 1. 1. 1. 1. 1. 1. 1. 0. 1. 1. 0. 1. 1. 0. 0. 0. A TM consists of an infinite length tape, on which

kahlilia
Download Presentation

Introduction to 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. Introduction toTuring Machines 0 0 1 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 0 0 0

  2. The Turing Machine 0 1 1 0 1 0 1 1 1 1 1 1 1 0 1 1 0 1 1 0 0 0 A TM consists of an infinite length tape, on which input is provided as a finite sequence of symbols. A head reads the input tape. The TM starts at start state s0. On reading an input symbol it optionally replaces it with another symbol, changes its internal state and moves one cell to the right or left.

  3. The Turing Machine A TM is defined as: TM = <S, T, s0, d, H> where, S is a set of TM states T is a set of tape symbols s0 is the start state H  S is a set of halting states d : S x T S x T x {L,R} is the transition function

  4. Simple TM Examples Turing Machine U+1: Given a string of 1s on a tape (followed by an infinite number of 0s), add one more 1 at the end of the string. #111100000000…….  #1111100000000……….

  5. Simple TM Examples TM: U+1 d(s0, 1) |-- (s0, 1, R) d(s0, 0) |-- (h, 1, STOP) #s0111100000…..  #1s011100000…..  #11s01100000…..  #111s0100000…..  #1111s000000…..  #11111h0000….. STOP

  6. Exercice Input = “aaaabb” What is the output for this input?

  7. Solution • s0“aaaabb” • s1“ aaaabb ” • s0“aaaabb ” • s1“aaaabb ” • s1“aaaabb ” • halt“aaaaab ” • Input = a finite sequence of “a” symbol, followed by an infinite sequence of “b”. • Describe what the output this machine generates.

  8. Turing’s Thesis Any mathematical problem solving that can be described by a mechanical procedure (algorithm) can be modeled by a Turing machine. All computers today perform only mechanical problem solving. They are no more expressive than a Turing machine.

  9. Turing’s Thesis • Turing’s thesis is not a “theorem” there is no “proof” for the thesis. • The theorem may be refuted by showing at least one task that is performed by a digital computer which cannot be performed by a Turing machine. • Many contentions have been made to this end. However, till date there have not been any conclusive evidence to refute Turing’s thesis.

  10. Conclusions • Turing machines are a minimal extension over PDAs which provide greater expressiveness. • TMs are at a level that is much below the assembly language of any typical microprocessor. • So in the practical world, TMs are more useful in what they cannot do rather than in what they can.

More Related