Triple
T7666829
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Computability Theory |
E173643
|
entity |
| Predicate | fieldOfStudy |
P3
|
FINISHED |
| Object |
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.
|
E679186
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c699562484819086752091e3164a27 |
elicitation | completed |
| NER | batch_69c701c1383c8190ab5bf803bd6211a9 |
ner | completed |
| NED1 | batch_69c89b260000819088d744ea8dc53cd2 |
ned_source_triple | completed |
| NED2 | batch_69c89c698f2c8190b5d2717835bd1d82 |
ned_description | completed |
| NEDg | batch_69c89c037d188190ace1c5e80a43aba0 |
nedg | completed |
Created at: March 27, 2026, 4 p.m.