def fgh(alpha, n): """Basic Fast Growing Hierarchy Calculator (Wainer)""" if n == 0: return 0 # Convention for f_a(0) if isinstance(alpha, int): # Finite ordinal if alpha == 0: return n + 1 else: result = n for _ in range(n): result = fgh(alpha - 1, result) return result
