Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
abstract machine
|
| gptkbp:basisFor |
gptkb:Church-Turing_thesis
gptkb:Turing_completeness universal computation |
| gptkbp:canBe |
deterministic
non-deterministic |
| gptkbp:cannotDecide |
undecidable problems
|
| gptkbp:decision |
recursive languages
|
| gptkbp:example |
theoretical computer science
|
| gptkbp:generalizes |
finite automaton
pushdown automaton |
| gptkbp:hasComponent |
gptkb:alphabet
transition function finite state control head tape set of states |
| gptkbp:hasProperty |
mathematical abstraction
symbolic computation discrete time not physically realizable basis of modern computers infinite memory stepwise operation |
| gptkbp:hasVariant |
Multi-tape Turing Machine
Non-deterministic Turing Machine Universal Turing Machine Probabilistic Turing Machine Quantum Turing Machine |
| https://www.w3.org/2000/01/rdf-schema#label |
Turing Machine
|
| gptkbp:introducedIn |
1936
|
| gptkbp:inventedBy |
gptkb:Alan_Turing
|
| gptkbp:limitation |
halting problem
cannot solve all problems infinite tape required |
| gptkbp:recognizedBy |
recursively enumerable languages
|
| gptkbp:relatedTo |
gptkb:lambda_calculus
gptkb:Post_machine gptkb:register_machine cellular automaton |
| gptkbp:studiedIn |
automata theory
recursion theory |
| gptkbp:usedFor |
formalizing computation
defining algorithm studying decidability |
| gptkbp:usedIn |
gptkb:complexity_theory
computability theory theoretical computer science |
| gptkbp:bfsParent |
gptkb:Jean-François_Peyret
|
| gptkbp:bfsLayer |
6
|