Turing machine(redirected from Deterministic Turing machine)
Also found in: Thesaurus, Acronyms, Encyclopedia.
A hypothetical computing device capable of storing information and responding to computational questions, used in mathematical studies of computability.
[After Alan Mathison Turingwho conceived such a machine.]
(Computer Science) a hypothetical universal computing machine able to modify its original instructions by reading, erasing, or writing a new symbol on a moving tape of fixed length that acts as its program. The concept was instrumental in the early development of computer systems
Tu′ring machine`(ˈtʊər ɪŋ, ˈtyʊər-)
a hypothetical computing device used in mathematical studies of the computability of numbers and in theories of automata.
[after Alan M. Turing (1912–54), English mathematician, who described such a machine in 1936]