Nondeterministic Turing Machines can make guesses during their computations. Guessing and later verifying is might be faster than computing the result. However, we show that nondeterministic Turing Machines cannot do things normal that cannot also be done by normal deterministic Turing Machines.
