A simple presentation on Turing Machine

1. Welcome to our presentation

2. Presentation topic:
• Turing machine
8/14/2017 2

3. Team members
• Md. Mominul islam (152-35-1190)
• Swagata Mandal (152-35-1184)
• Md. Ashikur Rahman (152-35-1185)
8/14/2017 3

4. 8/14/2017 4
INTRODUCING TURING MACHINES
Introduced by Alan Turing in 1936.
A simple mathematical model of a computer.
Models the computing capability of a
computer.

5. 8/14/2017 5
DEFINATION
A Turing machine (TM) is a finite-state
machine with an infinite tape and a tape head
that can read or write one tape cell and move
left or right.
It normally accepts the input string, or
completes its computation, by entering a final
or accepting state.
Tape is use for input and working storage.

6. 8/14/2017 6

7. 8/14/2017 7
Transition function
One move (denoted by |---) in a TM does the
following:
δ(q , X) = (p ,Y ,R/L)
• q is the current state
• X is the current tape symbol pointed by tape head
• State changes from q to p

8. 8/14/2017 8

9. 8/14/2017 9

10. 8/14/2017 10

11. 8/14/2017 11

12. 8/14/2017 12

13. 8/14/2017 13

14. 8/14/2017 14

15. 8/14/2017 15

16. 8/14/2017 16
Universal language and Turing
machine
The universal language Lu is the set of binary
strings that encode a pair (M , w) where w is
accepted by M
A Universal Turing machine (UTM) is a Turing
machine that can simulate an arbitrary Turing
machine on arbitrary input.

17. 8/14/2017 17
Properties of Turing Machines
 A Turing machine can recognize a language iff
it can be generated by a phrase-structure
grammar.
 The Church-Turing Thesis: A function can be
computed by an algorithm iff it can be
computed by a Turing machine.

18. Thank You
8/14/2017 18