Wikipedia definition
1. Alternating Turing machineIn 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 in 1976 (see References).
Read “Alternating Turing machine” on English Wikipedia
Read “交替性チューリング機械” on Japanese Wikipedia
Read “Alternating Turing machine” on DBpedia


to talk about this word.