Fast Growing | Hierarchy Calculator

if user_input.lower() == 'exit': break

class FGHCalculator: def __init__(self): self.steps = 0 self.max_steps = 10000 # Safety limit to prevent infinite loops fast growing hierarchy calculator

# Successor Ordinal: f_alpha+1(n) = f_alpha^n(n) if isinstance(alpha, int) and alpha >= 0: # Iterate the function 'n' times result = n for _ in range(n): result = self._f(alpha - 1, result) return result if user_input