alternating Turing machine

English

Noun

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.
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.