Triple
T26966492
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Turing reducibility |
E679186
|
entity |
| Predicate | instanceOf |
P0
|
FINISHED |
| Object | relative computability concept |
C52304
|
CONCEPT FINISHED |
How this triple was built (1 step)
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.
CD
Concept disambiguation
gpt-5-mini-2025-08-07
Target class: relative computability concept Context triple: [Turing reducibility, instanceOf, relative computability concept]
-
A.
model of computation
A model of computation is an abstract mathematical framework that defines how algorithms are represented and executed, specifying the rules, operations, and resources available for performing computations.
-
B.
complexity measure
A complexity measure is a quantitative function or criterion used to assess and compare the intricacy, difficulty, or resource requirements of objects, systems, or problems.
-
C.
numbering of partial recursive functions
The numbering of partial recursive functions is a systematic assignment of natural numbers (indices) to all partial recursive functions such that each index effectively encodes a Turing-computable procedure defining that function.
-
D.
polynomial-time many-one reduction
A polynomial-time many-one reduction is a function computable in polynomial time that transforms instances of one decision problem into instances of another such that the original instance is a "yes" instance if and only if the transformed instance is a "yes" instance.
-
E.
property of rewriting systems
A property of rewriting systems is a formal characteristic—such as confluence, termination, or completeness—that describes how and whether sequences of rule-based transformations behave and lead to consistent outcomes.
- F. None of above. chosen
Provenance (1 batch)
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_69eeeb4f3a448190b1e94b2d4776c16e |
completed | April 27, 2026, 4:51 a.m. |
Created at: April 27, 2026, 6:36 a.m.