nondeterministic turing machine
Transcription
-
- US Pronunciation
- US IPA
-
-
- US Pronunciation
- US IPA
-
Definition of nondeterministic turing machine words
- noun Technical meaning of nondeterministic turing machine (complexity) A normal (deterministic) Turing Machine that has a "guessing head" - a write-only head that writes a guess at a solution on the tape first, based on some arbitrary internal algorithm. The regular Turing Machine then runs and returns "yes" or "no" to indicate whether the solution is correct. A nondeterministic Turing Machine can solve nondeterministic polynomial time computational decision problems in a number of steps that is a polynomial function of the size of the input 1
Information block about the term
Parts of speech for Nondeterministic turing machine
noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
See also
Matching words
- Words starting with n
- Words starting with no
- Words starting with non
- Words starting with nond
- Words starting with nonde
- Words starting with nondet
- Words starting with nondete
- Words starting with nondeter
- Words starting with nondeterm
- Words starting with nondetermi
- Words starting with nondetermin
- Words starting with nondetermini
- Words starting with nondeterminis
- Words starting with nondeterminist
Was this page helpful?
Thank you for your feedback! Tell your friends about this page
Tell us why?