Presentation is loading. Please wait.

Presentation is loading. Please wait.

Introduction to Turing Machines 011011111101101100010.

Similar presentations


Presentation on theme: "Introduction to Turing Machines 011011111101101100010."— Presentation transcript:

1 Introduction to Turing Machines

2 The Turing Machine 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 s 0. 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 = where, S is a set of TM states T is a set of tape symbols s 0 is the start state H S is a set of halting states : 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. # ……. # ……….

5 Simple TM Examples TM: U+1 (s 0, 1) |-- (s 0, 1, R) (s 0, 0) |-- (h, 1, STOP) #s ….. #1s ….. #11s ….. #111s ….. #1111s ….. #11111h0000….. STOP

6 Exercice statesymbolΔ(state, symbol) S0S0 b(halt, a, stop) S0S0 a(S 1, a, right ) S1S1 b(halt, b, stop) S1S1 a(S 0, a, right ) Input = aaaabb What is the output for this input?

7 Solution s 0 aaaabb s 1 aaaabb s 0 aaaabb s 1 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 Turings 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 Turings Thesis Turings 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 Turings 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.


Download ppt "Introduction to Turing Machines 011011111101101100010."

Similar presentations


Ads by Google