Encyclopedia

universal Turing machine

Also found in: Dictionary, Acronyms, Wikipedia.

universal Turing machine

[¦yü·nə¦vər·səl ′tu̇r·iŋ mə‚shēn]
(computer science)
A Turing machine that can simulate any Turing machine.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
Mentioned in
References in periodicals archive
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.
Wittgenstein, turing, and the "finitude" of language
The How end of the spectrum is extremely general - like a universal Turing machine, and almost as difficult to program.
How the "what" becomes the "how." (artificial intelligence)
This claim is motivated in part by the belief that a computer must be able to do anything which a mind can do, because a modern computer is, in principle, a UNIVERSAL Turing Machine and also in part by the claim that 'the raw computational power of a modern digital computer is about 10,000 times greater than that of the brain'.
Parallel architectures and mental computation
Copyright © 2003-2025 Farlex, Inc Disclaimer
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.