Word:

Nondeterministic Turing Machine

(complexity)Nondeterministic Turing Machine - 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
Browse
noncyclic
noncyclical
Nonda
Nondecane
Nondeciduate
nondecisive
nondeductible
Nondelivery
nondenominational
Nondeposition
nondepository financial institution
nondescript
nondeterminism
nondeterministic
nondeterministic automaton
nondeterministic polynomial time
-- Nondeterministic Turing Machine --
Nondevelopment
nondigestible
nondirectional antenna
Nondiscovery
nondiscretionary trust
nondiscrimination
nondisjunction
nondisposable
Nondo
nondrinker
nondriver
nondurable
None
None of
None-so-pretty
nonechoic
Definitions Index: # A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

About this site and copyright information - Online Dictionary Home - Privacy Policy