bn:00078634n
Noun Concept
Categories: Theoretical computer science, 1936 in computer science, Educational abstract machines, Computability theory, Abstract machines
EN
Turing machine
EN
A hypothetical computer with an infinitely long memory tape WordNet 3.0
Definitions
Relations
Sources
EN
A hypothetical computer with an infinitely long memory tape WordNet 3.0 & Open English WordNet
A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Wikipedia
An abstract model of a computer Wikipedia Disambiguation
Abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules Wikidata
Extremely basic abstract symbol-manipulating devices which, despite their simplicity, can be adapted to simulate the logic of any computer that could possibly be constructed. OmegaWiki
An abstract computing machine introduced in 1936 by Alan Turing to give a mathematically precise definition of computability. Wiktionary
Abstract machine. Wiktionary (translation)