Triple
T1255218
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Church–Turing thesis |
E26972
|
entity |
| Predicate | hasVariant |
P455
|
FINISHED |
| Object | Church–Turing–Deutsch principle |
E26972
|
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: Church–Turing–Deutsch principle | Statement: [Church–Turing thesis, hasVariant, Church–Turing–Deutsch principle]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Church–Turing–Deutsch principle Context triple: [Church–Turing thesis, hasVariant, Church–Turing–Deutsch principle]
-
A.
Church–Turing thesis
chosen
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).
-
B.
Blum axioms
Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
-
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.
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.
-
E.
Blum complexity measures
Blum complexity measures are a formal framework in computational complexity theory that rigorously define and compare the resource usage (such as time or space) of algorithms via axiomatic conditions.
- 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_69a49487a9c48190ba9b05348fd1b53f |
completed | March 1, 2026, 7:33 p.m. |
| NER | Named-entity recognition | batch_69a4bfa5a4cc819093ed686619b572d8 |
completed | March 1, 2026, 10:37 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ac93cb76248190a23acb2e76ecfa8d |
completed | March 7, 2026, 9:08 p.m. |
Created at: March 1, 2026, 7:47 p.m.