Turing machine
Jump to navigation
Jump to search
English[edit]
Etymology[edit]
Named after English mathematician, logician, and cryptographer Alan Turing (1912–1954), who introduced the concept in 1936 to give a mathematically precise definition of computability.
Noun[edit]
Turing machine (plural Turing machines)
- (computing theory) An abstract computing machine that has a finite number of possible internal states and operates on an infinite memory tape by first reading a symbol from a cell in the tape, and then, deterministically, based on that symbol and the machine’s state, writing a symbol in that cell, moving to a neighboring cell, and/or changing state.
Related terms[edit]
Translations[edit]
abstract machine
|
See also[edit]
Further reading[edit]
- Turing machine on Wikipedia.Wikipedia