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

单词	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
随便看	kralicky sneznik kral, janko kraljevic, miroslav kraljevo kraljevo municipality kraljevski beogradski ragbi klub kralupy nad vltavou kralyevo kral zepf freitag kram kramar, charles kramar, karel kramators'k kramatorsk kramden, ralph kramer, amihud kramer eastern european forum on audio and video solutions kramer, hilton krameria krameric kramer, jack kramer, josef kramer junction company kramer larry kramer, paul j.