Triple

T211710
Position Surface form Disambiguated ID Type / Status
Subject Alonzo Church E4733 entity
Predicate knownFor P22 FINISHED
Object 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).
E26972 NE FINISHED

How this triple was built (4 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: [Alonzo Church, knownFor, Church–Turing thesis]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Church–Turing thesis
Context triple: [Alonzo Church, knownFor, Church–Turing thesis]
  • A. 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.
  • B. 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.
  • C. von Neumann architecture
    The von Neumann architecture is a foundational computer design model in which a single memory stores both program instructions and data, executed sequentially by a central processing unit.
  • D. Alan Turing
    Alan Turing was a pioneering British mathematician and logician whose foundational work in computing and codebreaking established him as one of the principal founders of computer science and artificial intelligence.
  • E. An Investigation of the Laws of Thought
    An Investigation of the Laws of Thought is George Boole’s foundational 1854 treatise that established Boolean algebra and helped lay the groundwork for modern mathematical logic and computer science.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Church–Turing thesis
Triple: [Alonzo Church, knownFor, Church–Turing thesis]
Generated description
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).
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Church–Turing thesis
Target entity description: 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).
  • A. 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.
  • B. 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.
  • C. von Neumann architecture
    The von Neumann architecture is a foundational computer design model in which a single memory stores both program instructions and data, executed sequentially by a central processing unit.
  • D. Alan Turing
    Alan Turing was a pioneering British mathematician and logician whose foundational work in computing and codebreaking established him as one of the principal founders of computer science and artificial intelligence.
  • E. An Investigation of the Laws of Thought
    An Investigation of the Laws of Thought is George Boole’s foundational 1854 treatise that established Boolean algebra and helped lay the groundwork for modern mathematical logic and computer science.
  • F. None of above. chosen

Provenance (5 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_69a2575cb1dc8190a01ad332426dc339 completed Feb. 28, 2026, 2:47 a.m.
NER Named-entity recognition batch_69a25c2fd0648190bae9191a84129709 completed Feb. 28, 2026, 3:08 a.m.
NED1 Entity disambiguation (via context triple) batch_69a332cb28e08190a4e159b2631f5eb8 completed Feb. 28, 2026, 6:24 p.m.
NEDg Description generation batch_69a333537ae481909f16bc4b37303d8c completed Feb. 28, 2026, 6:26 p.m.
NED2 Entity disambiguation (via description) batch_69a333f5868c819083234c015ec243a5 completed Feb. 28, 2026, 6:29 p.m.
Created at: Feb. 28, 2026, 2:52 a.m.