Scribd
Upload
45 views

Turing Machine

The document discusses Turing machines, which are theoretical models of computation that can simulate any computer algorithm. It defines a Turing machine as a 7-tuple consisting of a finite set of states, tape alphabet, input alphabet, transition function, initial state, blank symbol, and set of final states. An example Turing machine is provided to demonstrate how it works. Advantages of Turing machines include checking decidability of problems and classifying problems in the polynomial hierarchy. Limitations include not modeling computational complexity and concurrency well. Turing machines can also be used as language recognizers, generators, evaluators, and deciders.

Uploaded by

Clasher hasan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
45 views

Turing Machine

The document discusses Turing machines, which are theoretical models of computation that can simulate any computer algorithm. It defines a Turing machine as a 7-tuple consisting of a finite set of states, tape alphabet, input alphabet, transition function, initial state, blank symbol, and set of final states. An example Turing machine is provided to demonstrate how it works. Advantages of Turing machines include checking decidability of problems and classifying problems in the polynomial hierarchy. Limitations include not modeling computational complexity and concurrency well. Turing machines can also be used as language recognizers, generators, evaluators, and deciders.

Uploaded by

Clasher hasan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Topic : Real life finite Automata (Turing Machine)

Course Title: Theory of Computation


Course code: SE-234

Submitted by Submitted To
Md Gaziur Rahman Shishir Fatama Binta Rafiq
Id: 201-35-3051 Lecturer
Section : A Department of Software Engineering
Department of SWE Daffodil International University
Turing Machine
• What is Turing Machine?
A Turing machine is hypothetical machine thought of by the mathematician Alan Turing in 1936.
Despite its simplicity, the machine can simulate any computer algorithm, no matter how
complicated it is!
Variations of Turing Machine
• Multitap Turing Machines
• Non-deterministic Turing machines
• Multihead Turing Machine
• Off-line Turing machine
• Multidimensional Turing machines
Turing Machine Definition
• A Turing Machine (TM) is a mathematical model which consists of an infinite length tape divided into
cells on which input is given. It consists of a head which reads the input tape. A state register stores
the state of the Turing machine. After reading an input symbol, it is replaced with another symbol, its
internal state is changed, and it moves from one cell to the right or left. If the TM reaches the final
state, the input string is accepted, otherwise rejected.

• A TM can be formally described as a 7-tuple (Q, X, ∑, δ, q0, B, F) where −


• Q is a finite set of states
• X is the tape alphabet
• ∑ is the input alphabet
• δ is a transition function; δ : Q × X → Q × X × {Left shift, Right shift}.
• q0 is the initial state
• B is the blank symbol
• F is the set of final states
Example of Turing machine
• Turing machine M = (Q, X, ∑, δ, q0, B, F) with
• Q = {q0, q1, q2, qf}
• X = {a, b}
• ∑ = {1}
• q0 = {q0}
• B = blank symbol
• F = {qf }
Example of Turing Machine

• δ is given by −
Tape alphabet symbol Present state ‘q0’ Present state’q1’ Present State’q2’

a 1Rq1 1Lq0 1Lqf

b 1Lq2 1Rq1 1Rqf

Here the transition 1Rq1 implies that the write symbol is 1, the tape moves right, and the next
state is q1. Similarly, the transition 1Lq2 implies that the write symbol is 1, the tape moves left,
and the next state is q2.
Example of Turing machine

State diagram for Turing machine M2 In this state diagram,


the label 0→ ,R appears on the transition from q1 to q2. This label signifies that when in state q1 with the
head reading 0, the machine goes to state q2, writes , and moves the head to the right.
In other words, δ(q1,0) = (q2, ,R).
For clarity we use the shorthand 0→R
in the transition from q3 to q4,
to mean that the machine moves
to the right when reading 0 in state
q3 but doesn’t alter the tape,
so δ(q3,0) = (q4,0,R).
Advantage of Turing machine
1.Check decidability if TM cannot solve a problem in countable time then there could not be
any algorithm which could solve that problem.
For a decision problem if its TM halt in countable time for all Finite length inputs then we
can say that the problem could be solved by an algorithm in countable time.

2.Classify problem TM helps to classify decidable problems into classes of polynomial


Hierarchy.
Suppose we found that the problem is decidable. Then out target become how efficiently we
can solve it . The efficiently been calculated in number of steps.

3.Design and implement algorithm for practical machines TM helps to propagate idea of
algorithm in practical machines. After the successful check of 1,2 criteria we can use our
practical devices/computers to design and implement algorithm.
Limitations of Turing Machine
1.Computational complexity
a. A limitation of Turing machine is that they do not model the strengths of a particular arrangement well.
b. For instance, modem stored-program computers are actually instances of a more specific form of abstract
machine known as the random access stared program.
c. An experimental prototype to machine or RASP machine model. Like the universal Turing Machine the
RASP stores its program in “memory” external to its finite-state achieve Turing machine machine’s
“instructions”
2.Concurrency
d. Another limitation of Turing machines is that they do not model concurrency well.
e. For example, there is a bound on the size of integer that can be computed by an always halting
nondeterministic Turing Machine starting on a blank tape.
f. By contrast, there are always-halting concurrent system with no inputs that can compute an integer of
unbounded size.
Uses of Turing Machine
• Turing machine as a language recognizer
• Turing Machine as a language generator
• Turing Machine as a language evaluator
• Turing Machine as a language decider
Thank you so much

You might also like