A nondeterministic Turing machine is a theoretical model of computation that allows for more than one possible action in certain situations. It is used to examine the abilities and limits of computers, and is related to the open problem of P versus NP.
Carnegie Mellon University
Spring 2015
A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.
No concepts data
+ 35 more concepts