Triple
T6370985
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Halting problem |
E143342
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
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.
|
E588867
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c008d8c61081908bcaf61510d881ed |
elicitation | completed |
| NER | batch_69c068289eac8190a17affed87340c1f |
ner | completed |
| NED1 | batch_69c62d9203988190a535b4f06f478292 |
ned_source_triple | completed |
| NED2 | batch_69c630eb15cc8190b55c6cf60c5690d2 |
ned_description | completed |
| NEDg | batch_69c6306eca2c81909ee4930c0dc62072 |
nedg | completed |
Created at: March 22, 2026, 4:33 p.m.