Triple
T9809921
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computability and Unsolvability |
E238242
|
entity |
| Predicate | topic |
P261
|
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: [Computability and Unsolvability, topic, Church–Turing thesis]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Church–Turing thesis Context triple: [Computability and Unsolvability, topic, 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.
Rice's theorem
Rice's theorem is a fundamental result in computability theory stating that any non-trivial semantic property of the language recognized by a Turing machine is undecidable.
-
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.
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.
-
E.
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.
- 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_69ca84defac48190abc1148804f184c1 |
completed | March 30, 2026, 2:12 p.m. |
| NER | Named-entity recognition | batch_69cdb220310c8190a16ca0b746f0ef7a |
completed | April 2, 2026, 12:02 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69d1cc5b4dd8819088c86946b4eb8a39 |
completed | April 5, 2026, 2:43 a.m. |
Created at: March 30, 2026, 8:29 p.m.