Algorithm Search⌘K

Definitionadvanced

Inverse Ackermann function

Also called alpha(n).

The inverse of the Ackermann function, which grows so slowly that it is at most 4 for any practical n and bounds union-find.

The inverse of the Ackermann function, which grows so slowly that it is at most 4 for any practical n and bounds union-find.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • one source with a locator