Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Computational Model
|
| gptkbp:decision |
Recursive Languages
|
| gptkbp:hasComponent |
gptkb:Head
gptkb:Tape Finite State Control |
| gptkbp:hasProperty |
Turing Completeness
|
| gptkbp:hasVariant |
Multi-tape Turing Machine
Non-deterministic Turing Machine Universal Turing Machine |
| https://www.w3.org/2000/01/rdf-schema#label |
Turing Machine Model
|
| gptkbp:influenced |
gptkb:Theory_of_Computation
Automata Theory Church-Turing Thesis |
| gptkbp:introducedIn |
1936
|
| gptkbp:inventedBy |
gptkb:Alan_Turing
|
| gptkbp:limitation |
Undecidability
Halting Problem |
| gptkbp:recognizedBy |
Recursively Enumerable Languages
|
| gptkbp:relatedTo |
gptkb:Lambda_Calculus
Finite Automaton Post Machine Pushdown Automaton |
| gptkbp:studiedIn |
gptkb:logic
Computer Science |
| gptkbp:usedFor |
Defining Algorithmic Computability
Formalizing Computation |
| gptkbp:bfsParent |
gptkb:TMM
|
| gptkbp:bfsLayer |
7
|