Triple
T2139624
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Martin Davis |
E46731
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
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.
|
E238242
|
NE FINISHED |
How this triple was built (4 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: Computability and Unsolvability | Statement: [Martin Davis, notableWork, Computability and Unsolvability]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Computability and Unsolvability Context triple: [Martin Davis, notableWork, Computability and Unsolvability]
-
A.
On Computable Numbers with an Application to the Entscheidungsproblem
"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.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
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.
-
D.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
E.
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.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg
Description generation
gpt-5.1
Instruction
Generate a one-sentence description of the target entity. You are given a context triple in the form (subject, predicate, object), where the object is the target entity. # Instructions Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. Avoid repeating the information from the triple, unless really essential. # Response Format Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Computability and Unsolvability Triple: [Martin Davis, notableWork, Computability and Unsolvability]
Generated description
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Computability and Unsolvability Target entity description: 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.
-
A.
On Computable Numbers with an Application to the Entscheidungsproblem
"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.
Computing with Register Machines
"Computing with Register Machines" is a chapter in the classic computer science textbook *Structure and Interpretation of Computer Programs* that introduces low-level machine models and shows how higher-level language constructs can be implemented using simple register-based operations.
-
C.
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.
-
D.
Lectures on the Logic of Arithmetic
Lectures on the Logic of Arithmetic is an educational work by Mary Everest Boole that explores the foundations and teaching of arithmetic through logical and psychological principles.
-
E.
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.
- F. None of above. chosen
Provenance (5 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_69a88a174ab48190a5db20c132e5dccf |
completed | March 4, 2026, 7:37 p.m. |
| NER | Named-entity recognition | batch_69abbe025d3c81908bcb33a7ff09eae8 |
completed | March 7, 2026, 5:56 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ae51b1290c8190a08850b428c99a6c |
completed | March 9, 2026, 4:50 a.m. |
| NEDg | Description generation | batch_69ae55923b748190bf7a2df3ae94edc8 |
completed | March 9, 2026, 5:07 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ae55fdc32c8190b6ecdc9b23d64cc5 |
completed | March 9, 2026, 5:09 a.m. |
Created at: March 4, 2026, 7:44 p.m.