Unambiguous Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. An unambiguous Turing machine is a special kind of non-deterministic Turing machine, which, in some sense, is similar to a deterministic Turing machine.
primaryTopic
Unambiguous Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. An unambiguous Turing machine is a special kind of non-deterministic Turing machine, which, in some sense, is similar to a deterministic Turing machine.
has abstract
In theoretical computer scienc ...... deterministic Turing machine.
@en
Na computação teórica, uma máq ...... uina de Turing determinística.
@pt
Wikipage page ID
49,020,514
Wikipage revision ID
735,379,134
subject
hypernym
type
comment
In theoretical computer scienc ...... deterministic Turing machine.
@en
Na computação teórica, uma máq ...... uina de Turing determinística.
@pt
label
Máquina de Turing Não Ambígua
@pt
Unambiguous Turing machine
@en