bn:03625160n
Noun Concept
Categories: All articles needing additional references, Models of computation
EN
alternating Turing machine  Alternating computation  Alternating Turing Machine, ATM  alternation  existential state
EN
In computational complexity theory, an alternating Turing machine is a non-deterministic Turing machine with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, an alternating Turing machine is a non-deterministic Turing machine with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. Wikipedia
A model of computation used in theoretical computer science Wikipedia Disambiguation