Get flash to fully experience Pearltrees
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.
An artistic representation of a Turing machine (Rules table not represented) A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of any computer algorithm , and is particularly useful in explaining the functions of a CPU inside a computer. The "Turing" machine was invented in 1936 by Alan Turing [ 1 ] who called it an "a-machine" (automatic machine).