Alternating Turing machine
Abstract computation model / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Alternating Turing machine?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer[1] and independently by Kozen[2] in 1976, with a joint journal publication in 1981.[3]
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (May 2011) |