Turing machine
E2505
abstract computational model
automaton
formal system
mathematical model of computation
theoretical computer science concept
A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
All labels observed (6)
| Label | Occurrences |
|---|---|
| Turing machines | 24 |
| Turing machine canonical | 11 |
| universal Turing machine | 6 |
| Turing machine model | 1 |
| classical Turing machine model | 1 |
| universal Turing machines | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T32282 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turing machine Context triple: [Chomsky hierarchy, correspondsToAutomatonModel, Turing machine]
-
A.
Differential analyzer
The Differential Analyzer is an early analog mechanical computer designed to solve differential equations using interconnected rotating shafts and wheels.
-
B.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
C.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
D.
Bolt Beranek and Newman
Bolt Beranek and Newman was a pioneering American research and engineering firm best known for its foundational role in developing the ARPANET, a precursor to the modern internet.
-
E.
Claude
Claude is a given name most famously associated with Claude Shannon, the American mathematician and electrical engineer known as the father of information theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Turing machine Target entity description: A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
-
A.
Differential analyzer
The Differential Analyzer is an early analog mechanical computer designed to solve differential equations using interconnected rotating shafts and wheels.
-
B.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
-
C.
Man-Computer Symbiosis
Man-Computer Symbiosis is a seminal 1960 essay by J. C. R. Licklider that envisioned interactive, cooperative partnerships between humans and computers, laying conceptual foundations for modern interactive computing and the internet.
-
D.
Bolt Beranek and Newman
Bolt Beranek and Newman was a pioneering American research and engineering firm best known for its foundational role in developing the ARPANET, a precursor to the modern internet.
-
E.
Claude
Claude is a given name most famously associated with Claude Shannon, the American mathematician and electrical engineer known as the father of information theory.
- F. None of above. chosen
Statements (60)
| Predicate | Object |
|---|---|
| instanceOf |
abstract computational model
ⓘ
automaton ⓘ formal system ⓘ mathematical model of computation ⓘ theoretical computer science concept ⓘ |
| coreConceptOf |
algorithm
ⓘ
decision problem ⓘ effective computability ⓘ halting problem ⓘ |
| describedInWork | On Computable Numbers with an Application to the Entscheidungsproblem ⓘ |
| fieldOfUse |
complexity theory
ⓘ
computability theory ⓘ mathematical logic ⓘ theoretical computer science ⓘ |
| hasComponent |
finite control
ⓘ
set of states ⓘ tape ⓘ tape head ⓘ transition function ⓘ |
| hasProperty |
can be encoded as a finite description
ⓘ
can be extended to nondeterministic variants ⓘ can be simulated by a universal Turing machine ⓘ can enter halting states ⓘ can simulate any algorithmically computable function ⓘ computes by successive configurations ⓘ configuration is determined by state tape contents and head position ⓘ deterministic in its basic form ⓘ discrete space model ⓘ discrete time model ⓘ has a designated start state ⓘ has a distinguished blank symbol ⓘ has a finite alphabet of tape symbols ⓘ is a basis for the Church–Turing thesis ⓘ is equivalent in power to lambda calculus ⓘ is equivalent in power to recursive functions ⓘ is equivalent in power to register machines ⓘ is used in proofs of incompleteness ⓘ is used in proofs of undecidability ⓘ is used in reductions between problems ⓘ is used to define Turing-computable functions ⓘ is used to define complexity classes ⓘ is used to define decidability ⓘ is used to define semi-decidability ⓘ is used to formalize algorithms ⓘ manipulates symbols ⓘ may have one or more halting states ⓘ stepwise operation ⓘ supports head movement left or right ⓘ supports read and write operations ⓘ uses infinite tape ⓘ |
| hasVariant |
alternating Turing machine
ⓘ
deterministic Turing machine ⓘ multi-tape Turing machine ⓘ multi-track Turing machine ⓘ nondeterministic Turing machine ⓘ oracle Turing machine ⓘ probabilistic Turing machine ⓘ universal Turing machine ⓘ |
| introducedIn | 1936 ⓘ |
| namedAfter | Alan Turing ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Turing machine Description of subject: A Turing machine is an abstract computational model that manipulates symbols on an infinite tape according to a set of rules, providing a formal foundation for the concept of algorithm and computability.
Referenced by (44)
Full triples — surface form annotated when it differs from this entity's canonical label.
On Computable Numbers, with an Application to the Entscheidungsproblem
→
mainSubject
→
Turing machines
ⓘ
subject linked to:
On Computable Numbers with an Application to the Entscheidungsproblem
linked to: Turing machine
On Computable Numbers, with an Application to the Entscheidungsproblem
→
introducesConcept
→
Turing machine
ⓘ
subject linked to:
On Computable Numbers with an Application to the Entscheidungsproblem
On Computable Numbers, with an Application to the Entscheidungsproblem
→
introducesConcept
→
universal Turing machine
ⓘ
subject linked to:
On Computable Numbers with an Application to the Entscheidungsproblem
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
Universal Intelligence: A Definition of Machine Intelligence
→
usesConcept
→
universal Turing machine
ⓘ
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
subject linked to:
Neural Turing Machines (contributions)
linked to: Turing machine
subject linked to:
"Introduction to Automata Theory, Languages, and Computation"
linked to: Turing machine
linked to: Turing machine
subject linked to:
MIP equals NEXP
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
linked to: Turing machine
subject linked to:
Formal Language Theory
linked to: Turing machine
subject linked to:
Automata and Computability (textbook)
linked to: Turing machine
subject linked to:
H10
linked to: Turing machine