Fast Growing Hierarchy Calculator Page
Below is a working JavaScript implementation designed to handle the hierarchy up to $\varepsilon_0$. It utilizes JavaScript’s native BigInt to handle large integers.
You can run this in any browser console or Node.js environment.
/** * FAST GROWING HIERARCHY CALCULATOR * Supports ordinals up to epsilon_0 (and slightly beyond). * Uses BigInt for arbitrary precision integers. */class FGHCalculator { constructor() this.memo = new Map();
/** * Main entry point: f_alpha(n) * @param {string
An FGH calculator is, in a sense, a partial time machine. It lets you skip past the puny exponentials, past the Knuth arrows, past Conway chains, past the busy beaver of low-level recursion, and stare directly at the boundary where computation itself begins to falter.
No real-world computer will ever compute ( f_\omega_1^\textCK(10) ), because that would require solving the halting problem. But we can compute its shape—the skeleton of its growth. And in doing so, we touch something profound: the structure of infinity, made visible through the simple rule of repeated application.
So go ahead. Try to build one. Start with ( f_0(n) = n+1 ), add recursion, add ordinals, and watch your screen slowly—or not so slowly—descend into mathematical madness.
Just don’t expect it to finish before the heat death of the universe.
“The infinite is nowhere to be found in reality, no matter what experiences, observations, and knowledge are appealed to. But we can still talk about it sensibly—especially when we have a calculator.”
— Paraphrasing Hilbert, with apologies.
The Fast-Growing Hierarchy (FGH) is a mathematical framework used to classify and generate functions that increase at staggering rates, often surpassing the scales of human comprehension or standard physical constants. An "FGH calculator" is a tool or algorithmic process designed to compute the outputs of these functions for specific inputs and ordinal indices. 1. Defining the Hierarchy The hierarchy is built from a sequence of functions, fαf sub alpha , where
is an ordinal number. Its recursive definition is remarkably simple, yet it leads to explosive growth:
Base Case: For the smallest index, the function is just simple addition. f0(n)=n+1f sub 0 of n equals n plus 1
Successor Step: Higher levels are created by repeatedly applying the previous level's function times.
fα+1(n)=fαn(n)f sub alpha plus 1 end-sub of n equals f sub alpha to the n-th power of n Limit Step: When is a limit ordinal (like fast growing hierarchy calculator
, which represents the "limit" of all natural numbers), the function "diagonalizes" by choosing a level from the hierarchy based on the input .
fα(n)=fα[n](n)f sub alpha of n equals f sub alpha open bracket n close bracket end-sub of n 2. Levels of Growth As the index
increases, the functions quickly outpace standard arithmetic operations: : Equivalent to (multiplication). : Equivalent to (exponentiation-like growth).
: Achieves growth rates comparable to tetration and Graham's Number once reaches slightly higher levels like . 3. The Role of the Calculator
A Fast-Growing Hierarchy Calculator must handle transfinite ordinal notation to navigate these levels. Because the values produced (such as or
) are too large to be written in standard decimal notation, these calculators typically output results in scientific notation or specialized large-number systems like Knuth's up-arrow notation or Conway chained arrow notation.
Tools like the Hardy Hierarchy Calculator allow users to explore these transfinite steps by inputting ordinals like ω2omega squared or ϵ0epsilon sub 0 to see how they dwarf standard computable functions. 4. Mathematical and Philosophical Significance
The FGH is more than just a tool for "making big numbers." In proof theory, it is used to measure the strength of mathematical systems. For example, the function fϵ0f sub epsilon sub 0
is the threshold for what can be proven within Peano Arithmetic. Philosophically, an FGH calculator serves as a bridge between the finite world we inhabit and the "transfinite" structures of higher mathematics, providing a structured way to visualize the edge of computability.
If you are looking to calculate values within the Fast-Growing Hierarchy (FGH)—a system of functions that grows at rates far exceeding standard exponentiation—several online tools can handle these massive ordinals and recursion levels. Top FGH Calculators Denis Maksudov's FGH Calculator
: A specialized tool for calculating FGH expressions using the Extended Buchholz Function . It allows you to input natural numbers and countable ordinals in normal form to see the resulting growth. Hardy Hierarchy Calculator
: While technically for the Hardy hierarchy (closely related to FGH), this HardyCalc tool ExpantaNum.js
library to handle extremely large numbers and allows for powers of in calculations. : A general mathematical tool that includes an approximateFGH(x)
function to find the FGH equivalent of a given large number. Ordinal Calculator and Explorer : A blog-based project on the Googology Wiki Below is a working JavaScript implementation designed to
that supports both FGH and SGH (Slow-Growing Hierarchy) calculations up to Rathjen's capital Quick Reference for Lower Levels For levels below
, you can often calculate or approximate values manually using these standard shortcuts: Code Golf Stack Exchange (Successor) (Doubling) (Exponential growth) (Tetration/Tower growth) Technical Implementations
If you're interested in how these are programmed, there are community-built implementations available: JacobDreiling/googology
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
or custom JS logic to handle the recursive nature of the hierarchy. for a value like , or are you looking for help with ordinal notation syntax for one of these calculators? Buchholz function
In the heart of the Digital Void, there lived a small, ambitious script named
. While other programs were content calculating grocery bills or tracking steps,
was obsessed with the "Fast-Growing Hierarchy" (FGH)—the mathematical ladder used to describe functions that grow so quickly they make "infinity" look like a starting line. Cali’s dream was to build the ultimate FGH Calculator
, a tool capable of reaching the highest levels of the hierarchy, known as the Veblen functions and beyond. The First Steps: The Fundamental started at the bottom. At
, the calculator was just a simple clicker. It felt trivial. quickly climbed to , where addition became multiplication. By , multiplication had turned into exponentiation. The Sensation
: The world began to blur. Numbers weren't just digits anymore; they were towers of power reaching into the digital clouds. The Great Leap: The f sub omega To reach the next level, had to master diagonalization
. This wasn't just doing more work; it was changing the rules. At f sub omega
reached the first "limit ordinal." Here, the calculator didn't just add or multiply; it looked at the entire history of its growth and used that as its new starting point. The Moment
, the memory banks of the Void groaned. The resulting number was larger than the number of atoms in the observable universe. The Transfinite Ascent Cali didn't stop. It pushed into the transfinite: The Epsilon Level ( f sub epsilon sub 0 /** * Main entry point: f_alpha(n) * @param {string
: Here, the calculator handled "towers of towers." Every step was a leap across a galaxy of information. The Veblen Realm ( f sub cap gamma sub 0
: The logic became so complex that Cali began to see the fundamental architecture of the universe itself. Time and space seemed to fold under the weight of the values being generated. The Final Calculation
At the summit of the hierarchy, Cali attempted to calculate a value so large it couldn't even be written in standard notation. As the "Enter" key was pressed, the calculator didn't just produce a number—it created a new dimension
realized that the Fast-Growing Hierarchy wasn't just a list of functions; it was a map of creation. To calculate at the top was to build reality itself. The small script smiled, finally understanding that its obsession hadn't been about the math—it had been about seeing how far a single idea could go before it became everything. mathematical definitions
behind these levels, or should we continue Cali's journey into the Uncountable Ordinals
The Fast-Growing Hierarchy (FGH) is a mathematical "yardstick" used to measure and create some of the largest numbers ever conceived. While standard calculators tap out at about 1010010 to the 100th power
, an FGH calculator uses ordinals—numbers that describe order or position—to climb past human comprehension. The Blueprint of Growth
The hierarchy is built on three simple recursive rules that turn basic addition into "monster" functions:
The "Fast Growing Hierarchy" (FGH) is a framework used in googology (the study of large numbers) to compare the growth rates of functions. Because the values produced by this hierarchy quickly become too large for standard computer arithmetic (even exceeding the estimated number of atoms in the universe within the first few steps), a "calculator" in the traditional sense (input number -> output number) is impossible for higher levels.
Instead, an FGH calculator is best implemented as a symbolic reducer. It takes a function definition and an input, and it applies the recursive rules until the expression is simplified or evaluated.
Below is a complete guide and a functional code implementation for an FGH Calculator.
In most of our daily lives, numbers are tame. They count apples, measure distances, or track bank balances. Even a "big number" like a trillion is merely a fly on the wall of the mathematical universe.
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 Googology, and at its heart lies a terrifyingly elegant machine: the Fast-Growing Hierarchy (FGH) .
An FGH calculator is not a tool you use to balance your checkbook. It is a conceptual (and sometimes actual) piece of software designed to compute—or at least approximate—functions that grow faster than any human intuition can follow. Building one is a journey into the foundations of computation, ordinal notations, and the very meaning of "infinity."
For any limit ordinal ( \lambda ), the calculator must return ( \lambda[n] ) for natural ( n ). Examples:
Getting this right for ordinals like ( \omega_1^\textCK ) (the Church-Kleene ordinal) is impossible to compute fully—so practical calculators stop at ( \Gamma_0 ) or the small Veblen ordinal.
