Other Equivalent Machines and Methods
- Multidimensional Turing machine: For example, a model by Schönhage (1980) uses the four head-movement commands { North, South, East, West }.
- Single-tape, multi-head Turing machine: In an undecidability proof of the "problem of tag", Minsky 1961 and Shepherdson and Sturgis (1963) described machines with a single tape that could write along the tape with one head and read further along the tape with another.
- Markov Algorithm (1960) is another remarkably simple computational model, based on string rewriting, equivalent to the Turing machines.
- Lambda calculus
- Queue automaton
Read more about this topic: Turing Machine Equivalents
Famous quotes containing the words equivalent, machines and/or methods:
“Distinctions drawn by the mind are not necessarily equivalent to distinctions in reality.”
—Thomas Aquinas (c. 1225–1274)
“As machines become more and more efficient and perfect, so it will become clear that imperfection is the greatness of man.”
—Ernst Fischer (1899–1972)
“Commerce is unexpectedly confident and serene, alert, adventurous, and unwearied. It is very natural in its methods withal, far more so than many fantastic enterprises and sentimental experiments, and hence its singular success.”
—Henry David Thoreau (1817–1862)