indexed by α, starting from small functions and progressing to unimaginably fast-growing ones. f₀(n) = n + 1 : Simple succession. f₁(n) = 2n : Multiplication. : Exponential growth. : Tower of powers (tetration). : The first transfinite step, growing faster than any for finite k. As the ordinal α increases (e.g., ), the functions grow faster than any function previously defined [1].

The Ultimate Guide to the Fast-Growing Hierarchy: Concepts, Computation, and Calculators

Abstract A fast-growing hierarchy is a structured family of ordinal-indexed functions that exhibit rapidly increasing growth rates. These hierarchies formalize the notion of iterated growth beyond primitive-recursive and elementary functions and connect proof theory, ordinal analysis, and computability. This paper explains definitions, canonical examples (Grzegorczyk, Wainer/Hardy, Löb–Wainer), ordinal indexing, comparison methods, and computational/analytic applications. A worked example and references conclude.

The fast-growing hierarchy is often denoted as:

To find the value at the next level, you apply the previous level's function times repeatedly to the input . This is functional iteration.

A web‑based calculator might have:

, advanced theoretical computer science encounters massive bounds. The FGH helps classify the runtime of algorithms that are recursive but not primitive recursive.

For those looking to go further, are the next frontier. These functions, such as Buchholz's psi, use uncountable cardinals to define very large countable ordinals, allowing the FGH to reach far, far beyond (\epsilon_0). The Maksudov calculators are your best entry point for exploring this advanced realm. Additionally, using the Lean proof assistant, a definition of the FGH up to (\epsilon_0) is now formally verified (see the mathlib library), representing the future of verifiably correct FGH calculators.

If you are looking for a , or if you want to understand the profound mathematics driving these systems, this comprehensive guide will break down the mechanics, the ordinal indexing, and how computational tools handle the uncomputable. What is the Fast-Growing Hierarchy?

The hierarchy is defined by three simple rules:

A "High Quality" FGH calculator is distinguished by its ability to handle $f_\epsilon_0(n)$.

If a calculator misidentifies a successor ordinal as a limit ordinal, the math collapses entirely.

High‑quality calculators of the future may incorporate (e.g., Lean, Coq) to formally verify that a given implementation respects the chosen fundamental sequences, eliminating errors that plague many manual and semi‑automatic tools.