: An "Ordinal Expander" written in JavaScript. It's designed to compute the fundamental sequences for a modified version of the Extended Buchholz function. This tool is highly regarded within the googology community for its utility in investigating OCF-based ordinal notations.
, add , fundamental
Which or framework are you using for the backend?
(omega), which represents the infinity of natural numbers. A high-quality calculator resolves by substituting the limit ordinal with its -th fundamental sequence element, which is simply fω(n)=fn(n)f sub omega of n equals f sub n of n Therefore,
fα+1(n)=fαn(n)=fα(fα(…fα(n)…))⏟n timesf sub alpha plus 1 end-sub of n equals f sub alpha to the n-th power of n equals modified f sub alpha of open paren f sub alpha of open paren … f sub alpha of n … close paren close paren with under brace below with n times below : For a limit ordinal , the function "diagonalizes" over a fundamental sequence λ[n]lambda open bracket n close bracket fast growing hierarchy calculator high quality
In the world of googology—the study of exceptionally large numbers—the serves as the ultimate yardstick. While standard calculators fail at even basic exponents, a high-quality fast-growing hierarchy calculator allows enthusiasts and mathematicians to explore numbers that dwarf the observable universe. Understanding the Fast-Growing Hierarchy (FGH) The FGH is a family of functions, denoted as fαf sub alpha
If you want to delve deeper into building or using a fast-growing hierarchy tool, let me know:
α=ωβ1c1+ωβ2c2+…+ωβkckalpha equals omega raised to the beta sub 1 power c sub 1 plus omega raised to the beta sub 2 power c sub 2 plus … plus omega raised to the beta sub k power c sub k are positive integers.
The famous Kruskal's Tree Theorem produces a number known as TREE(3). This number completely eclipses Graham's number. It requires the Small Veblen Ordinal ( : An "Ordinal Expander" written in JavaScript
: Announced on the Googology Wiki, this tool is specifically designed to handle calculations and display fundamental sequences for ordinals up to a limit known as Rathjen's Capital Ψ (a very high proof-theoretic ordinal). It also includes a command-line system for advanced exploration.
Displaying the full symbolic expansion of a function above
Although primarily a library for storing large numbers (up to (f_\omega^\omega(1000)) in FGH), hugenumberjs can be embedded in web applications to provide a for FGH calculations. It represents numbers using Bird's linear array notation, making it suitable for incremental games and googology demos that require both extreme magnitude and moderate efficiency.
The standard FGH with Wainer fundamental sequences works up to (\varepsilon_0). To go higher, one must adopt ((\varphi_\alpha(\beta))), Feferman's (\theta) , or ordinal collapsing functions (e.g., (\psi(\Omega))). Recent research proves that Buchholz’s system of fundamental sequences for the (\vartheta) function satisfies the Bachmann property, opening the door to robust calculators for the Bachmann‑Howard ordinal and beyond. , add , fundamental Which or framework are
Set at the absolute fringes of googology, well beyond the reach of standard FGH calculators. Summary of the FGH Calculator Mechanics You provide an ordinal index ) and a base argument
To appreciate why a high-quality calculator requires unique software architecture, look at how the early finite indices correspond to everyday math operations: behaves like ( behaves like exponentiation ( behaves like tetration (towers of exponents, behaves like pentation ( ), passing Graham's number quickly. By the time a calculator reaches
If you are testing an online tool or a script you found on GitHub, use these benchmark calculations to verify its quality and accuracy: : Ensure equals 6, the successor rule is working. The Test : Ensure . For example, The Test : shifts into hyperoperations (exponential towers). should equal The Boundary : Enter . A high-quality calculator will correctly expand this to based on the standard fundamental sequence , outputting
When evaluating these tools, consider these key characteristics:
Calculating the Fast-Growing Hierarchy (FGH) manually is notoriously difficult due to how quickly the values explode—for example,