单词 |
nondeterministic turing machine |
释义 |
Nondeterministic Turing Machine Nondeterministic Turing Machine (complexity)A normal (deterministic) Turing Machine thathas a "guessing head" - a write-only head that writes a guessat a solution on the tape first, based on some arbitraryinternal algorithm. The regular Turing Machine then runsand returns "yes" or "no" to indicate whether the solution iscorrect.
A nondeterministic Turing Machine can solvenondeterministic polynomial time computational decision problems in a number of steps that is a polynomial functionof the size of the input |
随便看 |
|