Triple
T692625
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | On Computable Numbers, with an Application to the Entscheidungsproblem |
E13826
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | lambda calculus |
E26971
|
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: lambda calculus | Statement: [On Computable Numbers, with an Application to the Entscheidungsproblem, relatedTo, lambda calculus]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: lambda calculus Context triple: [On Computable Numbers, with an Application to the Entscheidungsproblem, relatedTo, lambda calculus]
-
A.
lambda calculus
chosen
Lambda calculus is a formal system in mathematical logic and computer science that uses function abstraction and application to investigate computation and serves as a foundational model for programming languages.
-
B.
Scheme
Scheme is a minimalist, lexically scoped dialect of the Lisp programming language known for its elegant functional programming model and powerful macro system.
-
C.
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).
-
D.
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.
-
E.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
- 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_69a493406c408190957eeec9048a8fb6 |
completed | March 1, 2026, 7:28 p.m. |
| NER | Named-entity recognition | batch_69a4a0b05f2c8190876c73db15b489a2 |
completed | March 1, 2026, 8:25 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69a5dca7871c81909ea5a4ccb5dcd47d |
completed | March 2, 2026, 6:53 p.m. |
Created at: March 1, 2026, 7:36 p.m.