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:
“The basis of world peace is the teaching which runs through almost all the great religions of the world. “Love thy neighbor as thyself.” Christ, some of the other great Jewish teachers, Buddha, all preached it. Their followers forgot it. What is the trouble between capital and labor, what is the trouble in many of our communities, but rather a universal forgetting that this teaching is one of our first obligations.”
—Eleanor Roosevelt (1884–1962)
“The machine is impersonal, it takes the pride away from a piece of work, the individual merits and defects that go along with all work that is not done by a machine—which is to say, its little bit of humanity.”
—Friedrich Nietzsche (1844–1900)