Non-deterministic turing machine
may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
A Turing machine is an idea from computer science that tries to describe how some computers work. Deterministic Turing machines use a function. Given the current state of the Turing machine, it selects another state the Turing machine should have. In other words, from each state there is one other state the machine can have. A non-deterministic Turing machine uses a relation. This means that from some states there are several other states that are possible.
