Fast Growing Hierarchy Calculator High Quality [updated] Jun 2026

where ( \lambda[n] ) is the (n)-th element of the fundamental sequence for ( \lambda ).

# Successor Ordinal if is_successor(alpha): # Try to derive closed form to avoid iteration stack overflow if alpha == 1: return x + x if alpha == 2: return x * (2**x) if alpha == 3: return tetration(x) # Symbolic Up-Arrow fast growing hierarchy calculator high quality

For ( \alpha < \varepsilon_0 ):