Statements (52)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational model
|
| gptkbp:composedOf |
tape
head state register |
| gptkbp:hasCitations |
practical computation
|
| gptkbp:hasHistoricalSignificance |
foundational concept in computer science
|
| gptkbp:hasRelatedPatent |
artificial intelligence
computer science mathematics |
| https://www.w3.org/2000/01/rdf-schema#label |
Turing Machines
|
| gptkbp:inventor |
gptkb:Alan_Turing
|
| gptkbp:isATypeOf |
abstract machine
|
| gptkbp:isCharacterizedBy |
infinite tape
finite state control read/write head |
| gptkbp:isConsidered |
a model of computation
a theoretical construct a basis for modern computing theory |
| gptkbp:isCounteredBy |
programming languages
modern computers state diagrams transition tables |
| gptkbp:isIncorporatedIn |
the limits of computation
|
| gptkbp:isNamedAfter |
gptkb:Alan_Turing
|
| gptkbp:isRelatedTo |
gptkb:P_vs_NP_problem
gptkb:Gödel's_incompleteness_theorems complexity theory formal languages automata theory theory of computation |
| gptkbp:isStudiedIn |
computer science courses
mathematics courses philosophy of mind |
| gptkbp:isUsedBy |
computational limits
algorithmic processes computational complexity classes decidability and undecidability |
| gptkbp:isUsedFor |
deterministic
non-deterministic multi-tape machines non-deterministic machines oracle machines |
| gptkbp:isUsedIn |
cryptography
algorithm analysis machine learning theoretical computer science algorithmic randomness proofs of undecidability |
| gptkbp:mayHave |
any algorithm
any computation that can be algorithmically defined |
| gptkbp:scientificName |
gptkb:Church-Turing_thesis
|
| gptkbp:usedFor |
defining computability
|