Scribd
Upload
55 views10 pages

Turing Machine

This document discusses the Turing machine, an abstract computational device introduced by Alan Turing in 1936. It summarizes that a Turing machine consists of 7 components: a finite set of states, input symbols, tape symbols, an initial state, final states, a blank symbol, and transition functions. It also describes how Turing machines take input and produce output through tape manipulation and state transitions governed by transition rules. In conclusion, the document states that Turing machines provide invaluable theoretical foundations for understanding computation and its limits.

Uploaded by

Faizan Qureshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
55 views10 pages

Turing Machine

This document discusses the Turing machine, an abstract computational device introduced by Alan Turing in 1936. It summarizes that a Turing machine consists of 7 components: a finite set of states, input symbols, tape symbols, an initial state, final states, a blank symbol, and transition functions. It also describes how Turing machines take input and produce output through tape manipulation and state transitions governed by transition rules. In conclusion, the document states that Turing machines provide invaluable theoretical foundations for understanding computation and its limits.

Uploaded by

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

NAME:- FAIZAN QURESHI

ENROLLMENT NO:-0198CS211034
SUBJECT:- THEORY OF
COMPUTATION(CS501)
YEAR:-3RD
SEMISTER:-5th
TOPIC:-TURING MACHINE
Turing
machine
THE POWERFUL MACHINE
Since 1936
INTRODUCTION
• Turing Machine Overview:
– A simple abstract computational device.
– Meant to determine the extent of computing real numbers.
– Investigates the limits of computation.
• Physical Representation:
– Resembles an open reel-to-reel tape reader.
– Scans symbols on the tape as it passes by the head.
• Tape Characteristics:
– Unlike magnetic tape, which uses specific sequences for information.
– Relies on optical identification for symbol interpretation.
– Allows for the use of various symbols for commands.
• Head Movement:
– The head moves around different parts of the tape.
– Reads and writes symbols for computation.
Turing machine consist

• A Turing machine can be defined as a collection of


7 components:
• Q: the finite set of states.
• ∑: the finite set of input symbols.
• T: the tape symbol.
• q0: the initial state.
• F: a set of final states.
• B: a blank symbol used as a end marker for input.
• δ: a transition or mapping function
Component of turing machine

Input and output

Tape manipulation

Transition Rules
INPUT AN D
OUTPUT
The machine takes
an input and
executes operations
based on the given
algorithm,
producing an
output.
Tape
Manipulation
The read/write
head moves across
the tape, modifying
symbols and
transitioning
between states.
Transition
Rules
The control
unit directs the
machine's
actions based
on the current
symbol and
state.
Conclusion
In conclusion, the Turing machine stands as a
cornerstone in the edifice of computer science,
providing us with invaluable insights into the
theoretical foundations of computation. Introduced
by Alan Turing, this abstract concept has
transcended its origins as a thought experiment to
become a linchpin in understanding the nature and
limits of algorithmic processes.
Thank you

You might also like