Triple
T6370982
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Halting problem |
E143342
|
entity |
| Predicate | introducedInWork |
P513
|
FINISHED |
| Object | On Computable Numbers, with an Application to the Entscheidungsproblem |
E13826
|
NE FINISHED |
How this triple was built (2 steps)
Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.
NER
Named-entity recognition
gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: On Computable Numbers, with an Application to the Entscheidungsproblem | Statement: [Halting problem, introducedInWork, On Computable Numbers, with an Application to the Entscheidungsproblem]
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: [Halting problem, introducedInWork, On Computable Numbers, with an Application to the Entscheidungsproblem]
-
A.
On Computable Numbers with an Application to the Entscheidungsproblem
chosen
"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.
-
B.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
-
C.
On a Problem of Formal Logic
"On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
-
D.
The Undecidable
The Undecidable is a classic anthology edited by Martin Davis that collects foundational papers on computability, Gödel’s incompleteness theorems, and the limits of formal mathematical systems.
-
E.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (3 batches)
The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.
| Step | Stage | Batch ID | Status | When |
|---|---|---|---|---|
| creating | Elicitation | batch_69c008d8c61081908bcaf61510d881ed |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c068289eac8190a17affed87340c1f |
completed | March 22, 2026, 10:07 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c62d9203988190a535b4f06f478292 |
completed | March 27, 2026, 7:11 a.m. |
Created at: March 22, 2026, 4:33 p.m.