universal Turing machine


Also found in: Acronyms, Encyclopedia, Wikipedia.

universal Turing machine

n.
A Turing machine that can do the work of any possible Turing machine and is thus powerful enough to perform any calculation, given enough time and memory. Also called universal computer, universal machine.
Translations
univerzalni Turingov stroj
References in periodicals archive ?
Woods, "Small fast universal Turing machines," Theoretical Computer Science, vol.
Turing himself introduced stronger machines than the universal Turing machine.
To establish this result, we posited (for reductio) a universal Turing machine capable of solving the general halting problem, and then considered whether it halts when given its own machine number.

Full browser ?