DEFINING COMPUTERS BY
T M ( T U R I N G M AC H I N E )
2
P R E S E N T E D B Y:
o ZOHA
o SAIRA
o SIBGHA
o MOON
o IQRA
3
CONTENTS
o Introduction
o Components
o Limitations
o Future of computing
o Conclusion
I N T RO & A L A N T U R I N G
I N T RO D U C T I O N
The topic "Defining Computers by Turing Machines" in the theory of automata
explores how Turing Machines (TMs) serve as mathematical models to define
the capabilities and limitations of computers. It delves into how TMs can
simulate the behavior of computer algorithms and systems.
ALAN TURING
• Born 1912, an Englishman, often
called the father of computer
science and artificial intelligence.
• One of the most prominent allied
code breakers in WWII.
• Pioneered many early computing
techniques.
• In 2009, the British gov’t issued a
formal apology to Turing .
7
ALAN TURING
Alan Turing made groundbreaking
contributions to the field of computing.
His concept of the Turing Machine laid
the foundation for modern computing
theory.
During World War II, Turing played a
crucial role in breaking the Enigma code,
which significantly aided the Allies.
His work in artificial intelligence and
cryptography continues to influence
computer science today.
T U R I N G M AC H I N E
9
DEFINITION:
Alan Turing is a father of this model.
It is a machine (automaton) capable of enumerating some arbitrary subset of
valid strings of an alphabet.
A Turing machine is an general example of CPU that controls all data
manipulation done by a computer.
10
COMPONENTS OF TM:
The components of defining
computers through Turing
Machines include:
The theoretical model consisting
of a tape, read/write head, finite
set of states, and transition
function, representing a
computer's operation.
11
COMPONENTS:
In this diagram:
• "State" represents by the name .
• "Symbol" denotes the symbols that
can be written on the tape.
• "Read/Write Head" indicates the
mechanism that reads from and
writes to the tape.
• "Tape" symbolizes the infinite
memory divided into cells.
12
L I M I TAT I O N S
14
L I M I TAT I O N S
o Simplicity: Turing Machines are simplified models that do not fully capture the complexities of modern
computers, such as parallelism, concurrency, and real-time processing.
o Infinite Tape: The theoretical infinite tape of a Turing Machine is not practical in real-world computing
systems, which have finite memory resources.
o Deterministic: Turing Machines are deterministic, meaning they follow a single set of rules for each input,
while real computers may exhibit non-deterministic behavior.
o Abstract Model: Turing Machines are abstract mathematical constructs, and there may be limitations in
directly applying their concepts to physical computing devices.
o Physical Constraints: Real computers are subject to physical limitations like processing speed, memory size,
and hardware constraints, which are not fully accounted for in the Turing Machine model.
o Practicality: While Turing Machines are useful for theoretical analysis, they may not always provide
practical solutions or insights for real-world computing problems.
VA R I A N T S
T U R I N G M AC H I N E
VA R I A N T S
Turing machine variants are modifications or extensions of the classical Turing
Machine model proposed by Alan Turing. These variants are developed to
explore different aspects of computation or to address specific computational
problems that are not fully captured by the classical model.
17
M U L T I - TA P E T U R I N G :
o Multi-tape Turing Machines have multiple tapes
where each tape is accessed with a separate
head.
o Each head can move independently of the other
heads. Initially the input is on tape 1 and others
are blank.
o At first, the first tape is occupied by the input and
the other tapes are kept blank.
o Next, the machine reads consecutive symbols
under its heads and the TM prints a symbol on
each tape and moves its heads.
o A Multi-tape Turing machine can be formally
described as a 6-tuple (Q, X, B, δ, q0, F)
18
NON-DETERMINISTIC:
o In a Non-Deterministic TM, for every state and
symbol, there are a group of actions the TM can
have. So, here the transitions are not
deterministic.
o The computation of a non-deterministic TM is a
tree of configurations that can be reached from
the start configuration.
o An input is accepted if there is at least one node
of the tree which is an accept configuration,
otherwise it is not accepted.
o If all branches of the computational tree halt on
all inputs, the non-deterministic Turing Machine
is called a Decider and if for some input, all
branches are rejected, the input is also rejected.
o A non-deterministic Turing machine can be
formally defined as a 6-tuple (Q, X, ∑, δ, q0, B, F)
FUTURE OF COMPUTING
T U R I N G M AC H I N E S &
MODERN COMPUTING
Turing Machines provided a
theoretical foundation for modern
computing by introducing
concepts like algorithms,
computation, and the universal
Turing Machine.
F U T U R E B E YO N D
TM
The future of computing is likely to
transcend the limitations of Turing
Machines. Emerging technologies
such as quantum computing,
neuromorphic computing, and
DNA computing.
CONCLUSION
In conclusion, defining computers through Turing Machines provides a
foundational framework for understanding computation. While Turing
Machines offer a simplified abstraction, they effectively capture the essence of
computation, enabling analysis, design, and exploration of computational
concepts and algorithms.
ANY QUESTIONS??
T H A N K YO U
