nondeterministic Turing machine
GPTKB entity
Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
abstract machine
|
| gptkbp:contrastsWith |
deterministic Turing machine
|
| gptkbp:describedBy |
Alan Turing's 1936 paper (conceptually, though not explicitly named)
|
| gptkbp:equivalentTo |
deterministic Turing machine (in terms of computability, but not efficiency)
|
| gptkbp:field |
gptkb:complexity_theory
computability theory theoretical computer science |
| gptkbp:formedBy |
automata theory
|
| gptkbp:hasApplication |
complexity class definitions
theoretical models of computation |
| gptkbp:hasComponent |
transition function
finite set of states infinite tape read/write head |
| gptkbp:hasLanguageClass |
gptkb:NP_languages
recursively enumerable languages |
| gptkbp:hasProperty |
can have multiple possible transitions for a given state and symbol
accepts input if at least one computation path leads to an accepting state |
| https://www.w3.org/2000/01/rdf-schema#label |
nondeterministic Turing machine
|
| gptkbp:inventedBy |
gptkb:John_von_Neumann
|
| gptkbp:limitation |
not physically realizable
|
| gptkbp:relatedTo |
Technical Machine
deterministic Turing machine nondeterminism |
| gptkbp:symbol |
gptkb:NTM
|
| gptkbp:usedIn |
gptkb:P_vs_NP_problem
definition of NP complexity class |
| gptkbp:bfsParent |
gptkb:Technical_Machine
|
| gptkbp:bfsLayer |
4
|