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.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
Translations
univerzalni Turingov stroj
References in periodicals archive ?
Bennett, "Logical depth and physical complexity," in The Universal Turing Machine: A Half-Century Survey, pp.
Turing himself introduced stronger machines than the universal Turing machine. An example is a Turing machine that includes an oracle capable of correctly answering any question with Yes or No.
Such a "universal Turing machine" could then be used to solve any problem that could be solved.

Full browser ?