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:
“We are now going through a period of demolition. In morals, in social life, in politics, in medicine, and in religion there is a universal upturning of foundations. But the day of reconstruction seems to be looming, and now the grand question is: Are there any sure and universal principles that will evolve a harmonious system in which we shall all agree?”
—Catherine E. Beecher (1800–1878)
“Man is a beautiful machine that works very badly.”
—H.L. (Henry Lewis)