Turing-machine
[too r-ing, tyoo r-] /ˈtʊər ɪŋ, ˈtyʊər-/
noun, Mathematics.
1.
a hypothetical device with a set of logical rules of computation: the concept is used in mathematical studies of the computability of numbers and in the mathematical theories of automata and computers.
Turing machine
noun
1.
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
Turing machine
An abstract model of a computing device, used in mathematical studies of computability. A Turing machine takes a tape with a string of symbols on it as an input, and can respond to a given symbol by changing its internal state, writing a new symbol on the tape, shifting the tape right or left to the next symbol, or halting. The inner state of the Turing machine is described by a finite state machine. It has been shown that if the answer to a computational problem can be computed in a finite amount of time, then there exists an abstract Turing machine that can compute it.
Read Also:
- Turingol
language A high-level language for programming Turing Machines by Donald Knuth. It was the subject of the first construction of a nontrivial attribute grammar. [“Semantics of Context-Free Languages”, D. Knuth, Math Sys Thy 2:127-145 (1975)]. (1995-10-08)
- Turing plus
Systems programming language, a concurrent descendant of Turing. [“The Turing Plus Report”, R.C. Holt & J.R. Cordy, CSRI, U Toronto, Feb 1987]. Available from Holt Software Assocs, Toronto [email protected].
- Turing tar-pit
A place where anything is possible but nothing of interest is practical. Alan M. Turing helped lay the foundations of computer science by showing that all machines and languages capable of expressing a certain very primitive set of operations are logically equivalent in the kinds of computations they can carry out, and in principle have […]
- Turing test
noun 1. a proposed test of a computer’s ability to think, requiring that the covert substitution of the computer for one of the participants in a keyboard and screen dialogue should be undetectable by the remaining human participant Turing test definition A test proposed by British mathematician Alan Turing, and often taken as a test […]
- Turion
noun, Botany. 1. a small shoot, as of asparagus or certain aquatic plants, from which a new plant can develop. noun 1. a perennating bud produced by many aquatic plants: it detaches from the parent plant and remains dormant until the following spring