Editing Alternating Turing machine (section)

{{Short description|Abstract computation model}}
{{turing}}
{{more footnotes|date=May 2011}}
{{null|date=May 2011}}
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 class]]es [[NP (complexity)|NP]] and [[co-NP]].  The concept of an ATM was set forth by [[Ashok K. Chandra|Chandra]] and [[Larry Stockmeyer|Stockmeyer]]<ref name=chasto>{{Cite conference|doi=10.1109/SFCS.1976.4|last1=Chandra|first1=Ashok K.|last2=Stockmeyer|first2=Larry J.|title=Alternation|book-title=Proc. 17th IEEE Symp. on Foundations of Computer Science|location=Houston, Texas|year=1976|pages=98–108}}</ref> and independently by [[Dexter Kozen|Kozen]]<ref name=kozen>{{cite conference|doi=10.1109/SFCS.1976.20|last=Kozen|first=D.|title=On parallelism in Turing machines|book-title=Proc. 17th IEEE Symp. on Foundations of Computer Science|location=Houston, Texas|year=1976|pages=89–97|hdl=1813/7056|hdl-access=free}}</ref> in 1976, with a joint journal publication in 1981.<ref name=alternation>{{Cite journal|doi=10.1145/322234.322243 |last1=Chandra |first1=Ashok K. |last2=Kozen |first2=Dexter C. |last3=Stockmeyer |first3=Larry J. |title=Alternation |url=http://users.cis.fiu.edu/~giri/teach/5420/f01/papers/p114-chandra.pdf |journal=[[Journal of the ACM]] |volume=28 |issue=1 |pages=114–133 |year=1981 |s2cid=238863413 |url-status=dead |archive-url=https://web.archive.org/web/20160412232110/http://users.cis.fiu.edu/~giri/teach/5420/f01/papers/p114-chandra.pdf |archive-date=April 12, 2016 }}</ref>