Understanding Alternating Turing Machines 🤖

If you find our videos helpful you can support us by buying something from amazon.
https://www.amazon.com/?tag=wiki-audio-20

Alternating Turing machine

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 and independently by Kozen in 1976, with a joint journal publication in 1981.

-Video is targeted to blind users

Attribution:
Article text available under CC-BY-SA
image source in video


https://www.youtube.com/watch?v=Y1JGk_BxfOs