Scribd
Upload
44 views8 pages

Submitted By: Submitted To Reg No Subject Roll No: Nandan Sharma: Prof. Ajay Kumar Bansal

The document discusses Turing machines and their use as a model of computation. It provides definitions of key concepts such as: 1) A Turing machine is a mathematical model of computation consisting of a tape divided into cells, a head that reads and writes symbols on the tape, finite states, and transition rules. 2) The Church-Turing thesis states that any algorithmic procedure that can be carried out by a human/computer can be modeled by a Turing machine. 3) Variations of Turing machines include non-deterministic and multi-tape models that increase their computational power.

Uploaded by

nandan sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
44 views8 pages

Submitted By: Submitted To Reg No Subject Roll No: Nandan Sharma: Prof. Ajay Kumar Bansal

The document discusses Turing machines and their use as a model of computation. It provides definitions of key concepts such as: 1) A Turing machine is a mathematical model of computation consisting of a tape divided into cells, a head that reads and writes symbols on the tape, finite states, and transition rules. 2) The Church-Turing thesis states that any algorithmic procedure that can be carried out by a human/computer can be modeled by a Turing machine. 3) Variations of Turing machines include non-deterministic and multi-tape models that increase their computational power.

Uploaded by

nandan sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 8

Submitted By : NANDAN SHARMA Submitted To : Prof.

Ajay Kumar Bansal

Reg No : 11910924 Subject : Automation Theory


Roll No : B 83

INTRODUCTION
In the early 1930s.mathematicans were trying to define effective
comopution.Alan Turing in 1939,Alanzo Church in 1933,S.C Kleen in
1935,Schonfinkel in 1965 gave Various models using the concept of turing
machine ,calculus,combinatory logic ,post-system and recursive function .It is
interesting to note that these were formulated much before the electro-
mechanical/electronic computer were devised Although these formalisim,
describing effective computiations.are dissimilar,they turn to be equivalent

Among these formalism, Turing’s formulation is accepted as a model of


algorithm or computation. The Church-turing thesis states that any algorithmic
procedure that can be carried out by human beings/computer can be carried
out by a turing machine. It has been universally accepted by computer
scienticts that the turing machine provides an idea theoretical model of a
computer

DEFINITION

• Turing machines are useful in several ways.


• The Turing machine is the most general model. It accepts type-0
languages.

• It can also be used for computing functions. It turns out to be a


mathematical model of partial recursive functions.
• Turing machines are also used for determining the undecidability of
certain languages and measuring the space and time complexity of
problems.

• One scans the cells one at a time and usually performs one of the three
simple operations,

• (i) Writing a new symbol in the cell being currently scanned,


• (ii) Moving to the cell left of the present cell,
• (iii) Moving to the cell right of the present cell.

TURING MACHINE MODEL


The Turing machine can be thought of as finite control connected to a
R/W (read/write) head.

It has one tape which is divided into a number of cells.

The block diagram of the basic model for the Turing machine is given:

• Each cell can store only one symbol.

• In one move, the machine examines the present symbol under the R/W
head on the tape and the present state of an automaton to determineIn
one move, the machine examines the present symbol under the R/W
head on the tape and the present state of an automaton to determine

TUPLE’S OF TURING MACHINE:


7-tuple M = (Q,Γ,Σ,δ,s,B,F), where:

• Q is a finite set of states

• Γ is the tape alphabet

• Σ ⊆ Γ is the input alphabet

• s ∈ Q is the initial state

• F ⊆ Q is the set of accepting states

• B ∈ Γ−Σ is the “blank symbol”(#)

• δ : Q×Γ → Q×Γ×{L,R} is the transition function.

REPRESENTATION BY TRANSITION TABLE:

Example:
Turing machine M = (Q,Γ,Σ,δ,s,B,F) with

• Q = {q0,q1,q2,q3,q4}

• Γ = {a,b,X,Y,#}

• Σ = {a,b}, • s = q0

•B=#

• δ given by a b X Y # q0 (q1,X,R) − − (q3,Y,R) − q1 (q1,a,R) (q2,Y,L) −


(q1,Y,R) − q2 (q2,a,L) − (q0,X,R) (q2,Y,L) − q3 − − − (q3,Y,R) (q4,#,R) q4 − − −
−−

M accepts a’n b’n. For example, its execution on aaabbb is


(q0,ε,aaabbb) (q1,XXXY Y,b) (q1,X,aabbb) (q2,XXXY,Y Y ) (q1,Xa,abbb)
(q2,XXX,Y Y Y ) (q1,Xaa,bbb) (q2,XX,XY Y Y ) (q2,Xa,aY bb) (q0,XXX,Y Y Y )
(q2,X,aaY bb) (q3,XXXY,Y Y ) (q2,ε,XaaY bb) (q3,XXXY Y,Y ) (q0,X,aaY bb)
(q3,XXXY Y Y,ε) (q1,XX,aY bb) (q4,XXXY Y Y #,ε)

DESIGN OF TURING MACHINES:


To try to make the Turing machine more powerful we could add to its features:
• Let its tape extend indefinitely in both directions.

• Let its tape have multiple tracks.

• Let there be several tapes, each with its independent tape head.

• Add nondeterminism. It turns out that none of these increase a Turing


machine’s capabilities as a recogniser.

MULTITAPE:
A multitape Turing machine has k tapes. It takes its input on tape 1, other tapes
are initially blank.

The transition function now has type δ : Q × Γ’ k → Q × Γ ‘k × {L, R} k It specifies


how the k tape heads behave when the machine is in state qi , reading a1, . . .
a’k: δ(qi , a1, . . . , a’k) = (qj ,(b1, . . . , b’k),(d1, . . . , d’k))
MULTIPLE TRACK:

NONDETERMINISTIC TURING MACHINES:


A nondeterministic Turing machine has a transition function of type δ : Q × Γ →
P(Q × Γ × {L, R}) If some computation branch lead to ‘accept’ then the machine
accepts its input. This is the same type of nondeterminism as NFAs possess.
TUPLE OF NONDETERMINISTIC TURING MACHINE:
A non-deterministic Turing machine can be formally defined as a 6-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 → P(Q × X × {Left_shift, Right_shift}).
 q0 is the initial state
 B is the blank symbol
 F is the set of final states

THE CHURCH-TURING THESIS :


Computable = what a Turing machine can compute
Note that we cannot hope to prove the Church-Turing thesis. On the
other hand, advances in physics could conceivably make the thesis false,
in that some weird physical device might decide Turing machine halting,
say.
The Church-Turing Thesis (cont.):-
Note that {p | p is a polynomial with integral root} is Turing
recognisable. To see this, here is how we can build a Turing machine M
to recognise it. Say the variables in p are x, y, and z. M can enumerate all
integer triples (i, j, k). So M can evaluate p on each value triple (i, j, k) in
turn. If any of these evaluations give 0, M says accept.
UNIVERSAL TURING MACHINE:
In computer science, a universal Turing machine (UTM) is
a Turing machine that can simulate an arbitrary Turing
machine on arbitrary input. The universal machine essentially
achieves this by reading both the description of the machine to
be simulated as well as the input there of from its own tape .
Theorem: There is a Turing machine UTM called the universal Turing
machine that, when run on ⟨M, w⟩, where M is a Turing machine and w
is a string, simulates M running on w.
Theorem: There is a WB program UWB called the universal WB
program that, when run on ⟨P, w⟩, where P is a WB program and w is a
string, simulates P running on w.
INTRODUCTION TO LINAR BOUNDED AUTOMATION:
A linear bounded automaton is a multi-track non-deterministic Turing
machine with a tape of some bounded finite length.
Length = function (Length of the initial input string, constant c)
Here,
Memory information ≤ c × Input information
The computation is restricted to the constant bounded area. The input
alphabet contains two special symbols which serve as left end markers
and right end markers which mean the transitions neither move to the
left of the left end marker nor to the right of the right end marker of the
tape.
A linear bounded automaton can be defined as an 8-tuple (Q, X, ∑, q 0,
ML, MR, δ, F) where −
 Q is a finite set of states
 X is the tape alphabet
 ∑ is the input alphabet
 q0 is the initial state
 ML is the left end marker
 MR is the right end marker where MR ≠ ML
 δ is a transition function which maps each pair (state, tape
symbol) to (state, tape symbol, Constant ‘c’) where c can be 0 or
+1 or -1
 F is the set of final states
A deterministic linear bounded automaton is always context-
sensitive and the linear bounded automaton with empty language
is undecidable..

You might also like