Triple

T9810012
Position Surface form Disambiguated ID Type / Status
Subject The Universal Computer E238244 entity
Predicate about P380 FINISHED
Object Hilbert’s Entscheidungsproblem E87086 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: Hilbert’s Entscheidungsproblem | Statement: [The Universal Computer, about, Hilbert’s Entscheidungsproblem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Hilbert’s Entscheidungsproblem
Context triple: [The Universal Computer, about, Hilbert’s Entscheidungsproblem]
  • A. Entscheidungsproblem chosen
    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.
  • B. Hilbert’s tenth problem
    Hilbert’s tenth problem is a famous unsolved question in mathematics that asked for a general algorithm to determine whether any given Diophantine equation has an integer solution, and whose negative answer helped establish fundamental limits of computability.
  • C. 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.
  • D. Hilbert’s second problem
    Hilbert’s second problem is one of David Hilbert’s famous list of 23 problems, asking for a proof of the consistency of arithmetic from a finite set of axioms using finitary methods.
  • E. 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.
  • 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_69d1d5b264c88190bf16c8c32c360878 completed April 5, 2026, 3:23 a.m.
Created at: March 30, 2026, 8:29 p.m.