Triple

T692624
Position Surface form Disambiguated ID Type / Status
Subject On Computable Numbers, with an Application to the Entscheidungsproblem E13826 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: [On Computable Numbers, with an Application to the Entscheidungsproblem, relatedTo, Church–Turing thesis]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Church–Turing thesis
Context triple: [On Computable Numbers, with an Application to the 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. 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.
  • D. On Computable Numbers with an Application to the Entscheidungsproblem
    "On Computable Numbers, with an Application to the Entscheidungsproblem" is Alan Turing’s landmark 1936 paper that introduced the Turing machine model and founded the formal study of computability and the limits of algorithmic decision procedures.
  • E. Hilbert’s program
    Hilbert’s program was an influential early-20th-century initiative in the foundations of mathematics that sought to formalize all of mathematics and prove its consistency using finitistic methods.
  • 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_69a637514c9081909938d0801f071fea completed March 3, 2026, 1:20 a.m.
Created at: March 1, 2026, 7:36 p.m.