Turing machine equivalents
A Turing machine is a hypothetical device with an infinite memory capacity, first conceived by Alan Turing in 1936. The machine manipulates symbols on a potentially infinite strip of tape according to a table of rules, and can be adapted to simulate the logic of any computer algorithm. While none of the following models have been shown to have more power than the single-tape, one-way infinite, multi-symbol Turing-machine model, their authors defined and used them to investigate questions and solve problems more easily than they could have if they had stayed with Turing's a-machine model.
seeAlso
primaryTopic
Turing machine equivalents
A Turing machine is a hypothetical device with an infinite memory capacity, first conceived by Alan Turing in 1936. The machine manipulates symbols on a potentially infinite strip of tape according to a table of rules, and can be adapted to simulate the logic of any computer algorithm. While none of the following models have been shown to have more power than the single-tape, one-way infinite, multi-symbol Turing-machine model, their authors defined and used them to investigate questions and solve problems more easily than they could have if they had stayed with Turing's a-machine model.
has abstract
A Turing machine is a hypothet ...... with Turing's a-machine model.
@en
Uma máquina de Turing é um dis ...... dicional da máquina de Turing.
@pt
Wikipage page ID
Wikipage revision ID
711.332.424
hypernym
type
comment
A Turing machine is a hypothet ...... with Turing's a-machine model.
@en
Uma máquina de Turing é um dis ...... lquer algoritmo de computador.
@pt
label
Máquinas de Turing equivalentes
@pt
Turing machine equivalents
@en