alternating Turing machine (countable and uncountable, plural alternating Turing machines)

1. (computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP.