Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Theory of Computation Lecture 10: Turning Machines

Summary: Theory of Computation
Lecture 10: Turning Machines
Max Alekseyev
University of South Carolina
February 14, 2012
Computing Models
We have already studied some computing models:
Finite automata are good model for devices that have small
amount of memory;
Pushdown automata are good models for devices that have an
unlimited but LIFO-type of memory.
However, as we have seen, some very simple tasks are still beyond
the capabilities of these models. We need a new model that would
represent general purpose computers.
Turing Machine
Turing machine (TM) was first proposed by Alan Turing in 1936.
It is similar to finite automata but has unlimited and unrestricted
memory. Hence, it is a more accurate model of general purpose
The TM model uses an infinite tape as its memory. It has a tape


Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina


Collections: Biotechnology; Computer Technologies and Information Sciences