A Turing machine is an abstract "machine" that manipulates symbols on a strip of tape according to a table of rules; to be more exact, it is a mathematical model that defines such a device. Despite its simplicity, a Turing machine can simulate the logic of any computer algorithm.The machine operates on an infinite memory tape divided into cells. The machine positions its head over a cell and "reads" (scans) the symbol there.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| rdfs:seeAlso | |
| is known for of |