Triple
T21088296
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Karp reduction |
E519560
|
entity |
| Predicate | contrastWith |
P278
|
FINISHED |
| Object | Turing reduction |
—
|
NE NERFINISHED |
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: Turing reduction | Statement: [Karp reduction, contrastWith, Turing reduction]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Turing reduction Context triple: [Karp reduction, contrastWith, Turing reduction]
-
A.
Turing reducibility
chosen
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.
-
B.
Karp reductions
Karp reductions are polynomial-time many-one reductions used in computational complexity theory to show that one decision problem is at least as hard as another, central to defining NP-completeness.
-
C.
Turing degrees
Turing degrees are an abstract classification of sets of natural numbers or decision problems according to their relative level of algorithmic unsolvability or computational complexity under Turing reducibility.
-
D.
Turing completeness
Turing completeness is a property of a computational system indicating that it can simulate any Turing machine and thus perform any computation that is algorithmically possible, given enough time and memory.
-
E.
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.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Provenance (2 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_69e0b507dd9081908fb8bfcbef4c8b46 |
completed | April 16, 2026, 10:08 a.m. |
| NER | Named-entity recognition | batch_69e7094cebe08190bb10f51a45c244ec |
completed | April 21, 2026, 5:21 a.m. |
Created at: April 16, 2026, 2:50 p.m.