Triple
T4492991
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Gödel numbering |
E100622
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object | Turing computability |
E173643
|
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: Turing computability | Statement: [Gödel numbering, relatedConcept, Turing computability]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turing computability Context triple: [Gödel numbering, relatedConcept, Turing computability]
-
A.
Computability Theory
chosen
Computability Theory is a branch of theoretical computer science and mathematical logic that studies which problems can be solved by algorithms and how efficiently they can be computed.
-
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.
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.
-
D.
Mathematical Theory of Computation
Mathematical Theory of Computation is a foundational textbook in theoretical computer science that systematically develops formal models of computation, computability, and complexity.
-
E.
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.
- 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_69bd43cdf15081909a4fa2585ff63b3e |
completed | March 20, 2026, 12:55 p.m. |
| NER | Named-entity recognition | batch_69bd5570ba0881908f5fb4f8d0730e64 |
completed | March 20, 2026, 2:10 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69bd67b40fd4819098636b6f29304312 |
completed | March 20, 2026, 3:28 p.m. |
Created at: March 20, 2026, 12:59 p.m.