bn:01488796n
Noun Concept
Categories: All articles lacking reliable references, Turing machine, All articles needing additional references, Articles with short description
EN
nondeterministic Turing machine  non-deterministic Turing machine  NDTM  Non deterministic Turing machine  Nondeterministic model of computation
EN
In theoretical computer science, a nondeterministic Turing machine is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. Wikipedia
Definitions
Relations
Sources
EN
In theoretical computer science, a nondeterministic Turing machine is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. Wikipedia
A theoretical model of computation Wikipedia Disambiguation
May have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol Wikidata