Triple
T20836460
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | NP-hardness |
E512971
|
entity |
| Predicate | exampleProblem |
P83422
|
FINISHED |
| Object | halting problem (under suitable reductions) |
—
|
NE NERFINISHED |
How this triple was built (3 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: halting problem (under suitable reductions) | Statement: [NP-hardness, exampleProblem, halting problem (under suitable reductions)]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: halting problem (under suitable reductions) Context triple: [NP-hardness, exampleProblem, halting problem (under suitable reductions)]
-
A.
Halting problem
chosen
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.
-
B.
Turing reducibility
Turing reducibility is a central computability-theoretic notion that compares the relative computational difficulty of decision problems by allowing one problem to be solved using an oracle for another.
-
C.
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.
-
D.
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.
-
E.
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).
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: exampleProblem Context triple: [NP-hardness, exampleProblem, halting problem (under suitable reductions)]
-
A.
typicalProblem
Indicates that a situation, issue, or obstacle is representative or characteristic of the usual problems encountered in a given context.
-
B.
problemType
chosen
Indicates the specific category or classification of a problem within a defined problem space or system.
-
C.
problemStatement
Indicates that an entity presents, defines, or expresses a specific problem or issue to be addressed.
-
D.
problemTypeSolved
Indicates that a given problem has been successfully solved or resolved by a particular entity or method.
-
E.
numberOfProblems
Indicates the quantity or count of problems associated with a given entity or situation.
- F. None of above.
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_69e0b4cf62a88190bbf92351e9e57259 |
completed | April 16, 2026, 10:07 a.m. |
| NER | Named-entity recognition | batch_69e6c326daec8190bd4caa41a4b38833 |
completed | April 21, 2026, 12:21 a.m. |
| PD | Predicate disambiguation | batch_69e5c9a1f4f48190aa9fb4ef8f8aea5a |
completed | April 20, 2026, 6:37 a.m. |
Created at: April 16, 2026, 12:42 p.m.