Fast Growing Hierarchy Calculator [updated] -

But there exists a different kind of number. A number so vast that it doesn't just dwarf a trillion—it makes the concept of "dwarfing" seem quaint. These numbers live in a strange, logical wilderness known as , and at its heart lies a terrifyingly elegant machine: the Fast-Growing Hierarchy (FGH) .

GitHub repository contains Python code for various FGH notations and a helper function to view calculations step-by-step. JavaScript : Most browser-based calculators mentioned above use ExpantaNum.js fast growing hierarchy calculator

: This level can describe numbers far beyond any named constant in physics. Calculator Logic But there exists a different kind of number

This is the successor function, the fundamental unit of growth. Successor Step GitHub repository contains Python code for various FGH

Below is a working designed to handle the hierarchy up to $\varepsilon_0$. It utilizes JavaScript’s native BigInt to handle large integers.

def calculate(self, alpha, n): """ Calculates f_alpha(n). alpha can be an integer (0, 1, 2...) or the string 'w' for omega. """ self.steps = 0 try: result = self._f(alpha, n) return result except RecursionError: return "Error: Recursion depth exceeded (Number is too big to compute)." except Exception as e: return f"Error: e"