Triple
T1859120
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Wilhelm Ackermann |
E41773
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object |
Ackermann function
The Ackermann function is a classic example of a computable function that grows faster than any primitive recursive function, often used in theoretical computer science to illustrate extreme computational complexity.
|
E208846
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a8864a83848190a4ec02721306c511 |
elicitation | completed |
| NER | batch_69abb0829f1481908d2b389d20827417 |
ner | completed |
| NED1 | batch_69add1ce296c819093336cbaa257dfd2 |
ned_source_triple | completed |
| NED2 | batch_69add29e3c50819098ff87d254c25c45 |
ned_description | completed |
| NEDg | batch_69add229de448190826bbb668c7611a0 |
nedg | completed |
Created at: March 4, 2026, 7:33 p.m.