Ackermann function

E208846 UNEXPLORED

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.

Jump to: Referenced by

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

Wilhelm Ackermann → developed → Ackermann function ⓘ

Wilhelm Ackermann → knownFor → Ackermann function ⓘ

Wilhelm Ackermann → notableConcept → Ackermann function ⓘ

Knuth’s up-arrow notation → relatedTo → Ackermann function ⓘ