On Computable Numbers with an Application to the Entscheidungsproblem
E13826
"On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
All labels observed (6)
How this entity was disambiguated
This entity first appeared as the object of triple T123963 — 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: On Computable Numbers with an Application to the Entscheidungsproblem Context triple: [Turing machine, describedInWork, On Computable Numbers with an Application to the Entscheidungsproblem]
-
A.
Turing machine
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.
-
B.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
C.
Principia Mathematica
Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
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.
- 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: On Computable Numbers with an Application to the Entscheidungsproblem Target entity description: "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
-
A.
Turing machine
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.
-
B.
A Symbolic Analysis of Relay and Switching Circuits
A Symbolic Analysis of Relay and Switching Circuits is Claude Shannon’s landmark 1937 master’s thesis that founded modern digital circuit design by applying Boolean algebra to relay and switching systems.
-
C.
Principia Mathematica
Principia Mathematica is a landmark three-volume work in mathematical logic and the foundations of mathematics, co-authored by Bertrand Russell and Alfred North Whitehead, which aimed to derive all mathematical truths from a formal system of symbolic logic.
-
D.
A Mathematical Theory of Communication
A Mathematical Theory of Communication is Claude Shannon’s landmark 1948 paper that founded information theory by rigorously defining concepts like information, entropy, and channel capacity.
-
E.
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.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
computer science foundational work
ⓘ
mathematics paper ⓘ scientific paper ⓘ |
| academicDiscipline |
foundations of mathematics
ⓘ
logic in computer science ⓘ |
| addressesProblem | Entscheidungsproblem ⓘ |
| author | Alan Turing ⓘ |
| citedAs |
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
surface form:
Turing 1936 paper
|
| countryOfPublication | United Kingdom ⓘ |
| field |
computability theory
ⓘ
mathematical logic ⓘ theoretical computer science ⓘ |
| followedBy |
lambda calculus
ⓘ
surface form:
Computability and λ-definability
|
| hasPart |
application to the Entscheidungsproblem
ⓘ
construction of a universal machine ⓘ definition of automatic machines ⓘ proof of the existence of uncomputable numbers ⓘ |
| historicalSignificance |
foundational paper in computability theory
ⓘ
one of the founding works of theoretical computer science ⓘ |
| influenced |
development of computer science
ⓘ
recursion theory ⓘ theory of algorithms ⓘ |
| influencedBy |
Entscheidungsproblem
ⓘ
surface form:
David Hilbert’s Entscheidungsproblem
Kurt Gödel’s work on formal systems ⓘ |
| introducesConcept |
Turing machine
ⓘ
computable function ⓘ computable real number ⓘ Turing machine ⓘ
surface form:
universal Turing machine
|
| language | English ⓘ |
| mainSubject |
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
surface form:
Entscheidungsproblem
Turing machine ⓘ
surface form:
Turing machines
computable numbers ⓘ |
| provesResult |
existence of uncomputable numbers
ⓘ
existence of undecidable problems ⓘ unsolvability of the Entscheidungsproblem ⓘ |
| publishedIn | Proceedings of the London Mathematical Society ⓘ |
| publisher | London Mathematical Society ⓘ |
| relatedTo |
Church–Turing thesis
ⓘ
Gödel's incompleteness theorems ⓘ
surface form:
Gödel’s incompleteness theorems
lambda calculus ⓘ |
| shortTitle |
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
surface form:
On Computable Numbers
|
| timePeriod | 20th century ⓘ |
| title |
On Computable Numbers with an Application to the Entscheidungsproblem
self-link
ⓘ
surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
|
| usesMethod |
diagonalization
ⓘ
encoding of machines as numbers ⓘ |
| yearPublished | 1936 ⓘ |
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: On Computable Numbers with an Application to the Entscheidungsproblem Description of subject: "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
Referenced by (8)
Full triples — surface form annotated when it differs from this entity's canonical label.
Turing machine
→
describedInWork
→
On Computable Numbers with an Application to the Entscheidungsproblem
ⓘ
this entity surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
On Computable Numbers with an Application to the Entscheidungsproblem
→
title
→
On Computable Numbers with an Application to the Entscheidungsproblem
self-link
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
On Computable Numbers with an Application to the Entscheidungsproblem
→
shortTitle
→
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
On Computable Numbers
On Computable Numbers with an Application to the Entscheidungsproblem
→
mainSubject
→
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
Entscheidungsproblem
On Computable Numbers with an Application to the Entscheidungsproblem
→
citedAs
→
On Computable Numbers with an Application to the Entscheidungsproblem
self-linksurface differs
ⓘ
subject surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
Turing 1936 paper
Halting problem
→
introducedInWork
→
On Computable Numbers with an Application to the Entscheidungsproblem
ⓘ
this entity surface form:
On Computable Numbers, with an Application to the Entscheidungsproblem
this entity surface form:
Turing’s paper on computable numbers and the Entscheidungsproblem