Google
×

Nondeterministic Turing machine

In theoretical computer science, a nondeterministic Turing machine is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. Wikipedia