Triple
T6370983
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Halting problem |
E143342
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object | 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: Entscheidungsproblem | Statement: [Halting problem, relatedTo, Entscheidungsproblem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Entscheidungsproblem Context triple: [Halting problem, relatedTo, 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.
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.
-
C.
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.
-
D.
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.
-
E.
Computability and Unsolvability
Computability and Unsolvability is a classic 1958 textbook by Martin Davis that systematically develops the theory of computable functions and undecidable problems, helping to shape modern computability theory.
- 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_69c008d8c61081908bcaf61510d881ed |
completed | March 22, 2026, 3:20 p.m. |
| NER | Named-entity recognition | batch_69c068289eac8190a17affed87340c1f |
completed | March 22, 2026, 10:07 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c62d9203988190a535b4f06f478292 |
completed | March 27, 2026, 7:11 a.m. |
Created at: March 22, 2026, 4:33 p.m.