Triple
T3995423
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Entscheidungsproblem |
E87086
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | Church–Turing thesis |
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 thesis | Statement: [Entscheidungsproblem, relatedTo, Church–Turing thesis]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Church–Turing thesis Context triple: [Entscheidungsproblem, relatedTo, Church–Turing thesis]
-
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.
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.
-
C.
Halting problem
The halting problem is a fundamental decision problem in computability theory that asks whether a given program will eventually stop running or continue to run forever, and is famously proven to be undecidable.
-
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.
Gödel's incompleteness theorems
Gödel's incompleteness theorems are two fundamental results in mathematical logic showing that any sufficiently powerful, consistent formal system cannot prove all true statements about arithmetic, and cannot prove its own consistency.
- 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_69aed94118148190975e6aa4e554cde9 |
completed | March 9, 2026, 2:29 p.m. |
| NER | Named-entity recognition | batch_69aefa2159d88190a01de8b038341916 |
completed | March 9, 2026, 4:49 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5403c703081908070625ebfb6fb5f |
completed | March 14, 2026, 11:02 a.m. |
Created at: March 9, 2026, 3:34 p.m.