In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simulated as well as the input thereof from its own tape. Alan Turing introduced this machine in 1936–1937. This model is considered by some (for example, Martin Davis (2000)) to be the origin of the stored program computer—used by John von Neumann (1946) for the "Electronic Computing Instrument" that now bears von Neumann's name: the von Neumann architecture. It is also known as universal computing machine, universal machine (UM), machine U, U.
In terms of computational complexity, a multi-tape universal Turing machine need only be slower by logarithmic factor compared to the machines it simulates.
Read more about Universal Turing Machine: Introduction, Stored-program Computer, Mathematical Theory, Efficiency, Smallest Machines, Example of Universal-machine Coding
Famous quotes containing the words universal and/or machine:
“Let us build altars to the Blessed Unity which holds nature and souls in perfect solution, and compels every atom to serve an universal end.”
—Ralph Waldo Emerson (1803–1882)
“Goodbye, boys; I’m under arrest. I may have to go to jail. I may not see you for a long time. Keep up the fight! Don’t surrender! Pay no attention to the injunction machine at Parkersburg. The Federal judge is a scab anyhow. While you starve he plays golf. While you serve humanity, he serves injunctions for the money powers.”
—Mother Jones (1830–1930)