Noun
universal Turing machine (plural universal Turing machines)
(computing theory) A Turing machine capable of simulating the behavior of any Turing machine.
As any Universal Turing machine can do what any other Turing machine can, a central calculator in principle has no advantage over a system of dispersed calculators (i. Source: Internet
Despite the language's intentionally obtuse and wordy syntax, INTERCAL is nevertheless Turing-complete : given enough memory, INTERCAL can solve any problem that a Universal Turing machine can solve. Source: Internet
Like the Universal Turing machine the RASP stores its "program" in "memory" external to its finite-state machine's "instructions". Source: Internet
A Universal Turing machine can be used to simulate any Turing machine and by extension the computational aspects of any possible real-world computer. Source: Internet