Triple
T629517
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Alan Turing |
E15893
|
entity |
| Predicate | notableWork |
P4
|
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: [Alan Turing, notableWork, 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: [Alan Turing, notableWork, 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.
Church–Turing thesis
The Church–Turing thesis is a foundational principle in computability theory stating that any function that can be effectively computed by an algorithm can be computed by a Turing machine (or equivalently by other formal models of computation).
-
C.
Hilbert’s program
Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
-
D.
Remarks on the Foundations of Mathematics
Remarks on the Foundations of Mathematics is a posthumously published collection of Ludwig Wittgenstein’s later writings that critically examines the nature of mathematical truth, proof, and practice from a philosophical and language-centered perspective.
-
E.
First Draft of a Report on the EDVAC
First Draft of a Report on the EDVAC is a seminal 1945 technical report that laid out the stored-program computer architecture that became the foundation for most modern computers.
- 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_69a4935c131c8190a5378c6bf101e8cc |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a49ec051bc8190b3e3f8651a367d77 |
completed | March 1, 2026, 8:17 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a56938be6481909a8eba01f5d856c1 |
completed | March 2, 2026, 10:40 a.m. |
Created at: March 1, 2026, 7:35 p.m.