Scribd
Upload
38 views10 pages

Introduction To: Turing Machines

A Turing machine consists of an infinite tape, a head, and a finite set of states. The head reads symbols on the tape and based on the symbol and current state, writes a new symbol, moves the head left or right, and transitions to a new state. A Turing machine can model any algorithmic or computable task according to Turing's thesis. Simple examples show how a Turing machine can increment a string of 1s by one. The document then provides details on the formal definition of a Turing machine and concludes by discussing Turing's thesis.

Uploaded by

Charlyn Jane Acosta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
38 views10 pages

Introduction To: Turing Machines

A Turing machine consists of an infinite tape, a head, and a finite set of states. The head reads symbols on the tape and based on the symbol and current state, writes a new symbol, moves the head left or right, and transitions to a new state. A Turing machine can model any algorithmic or computable task according to Turing's thesis. Simple examples show how a Turing machine can increment a string of 1s by one. The document then provides details on the formal definition of a Turing machine and concludes by discussing Turing's thesis.

Uploaded by

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

Introduction to

Turing Machines

0 0
1 1 1
0 1 1 1 1 1 1 0 1 1 0 1 1 0 0 0
The Turing Machine
10 0
1 1 1
0 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.
The Turing Machine
A TM is defined as:
TM = <S, T, s0, , 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
 : S x T S x T x {L,R}
is the transition function
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……….
Simple TM Examples

TM: U+1
(s0, 1) |-- (s0, 1, R)
(s0, 0) |-- (h, 1, STOP)

#s0111100000….. 
#1s011100000….. 
#11s01100000….. 
#111s0100000….. 
#1111s000000….. 
#11111h0000….. STOP
Exercice

state symbol Δ(state, symbol)


S0 b (halt, a, stop)
S0 a (S1 , a, right )
S1 b (halt, b, stop)
S1 a (S0 , a, right )

Input = “aaaabb”
What is the output for this input?
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.
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.
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.
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.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy