Turing Machine

From Citizendium
Revision as of 17:55, 1 January 2008 by imported>Warren Schudy (See talk page)
Jump to navigation Jump to search
This article is a stub and thus not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
https://en.citizendium.org/wiki/index.php?title=Turing_Machine&printable=yes
This editable Main Article is under development and subject to a disclaimer.

Turing Completeness

A device that can simulate any Turing Machine is called Turing complete. The device does not necessarily have to be intentionally designed to compute or be a computer; if a device, piece of software or even an abstract concept meets the criteria it is Turing complete.

Even software that is only used as a teaching tool or exist only as a concept, not as an implementation (such as Donald Knuth's MMIX[1] can be considered "Turing complete," in a completely abstract sense.

The name "Turing machine" and the concept known as "Turing completeness" are both derived from noted mathematician and computer scientist Alan Turing.

References

  1. ↑ Donald Knuth. Knuth: MMIX. Retrieved on 2007-11-10.
Retrieved from "https://citizendium.org/wiki/index.php?title=Turing_Machine&oldid=331239"