Let’s assume you have found a functional FGH calculator (e.g., a custom JavaScript tool on a googology forum or a Python library like fgh.py ). Here is how you use it.
Each function in the hierarchy grows significantly faster than the previous one, with the growth rate accelerating rapidly. For instance, F_3(x) grows much faster than F_2(x), which in turn grows much faster than F_1(x). fast growing hierarchy calculator
if __name__ == "__main__": main()
But what exactly is an FGH calculator? Can a machine truly compute the uncomputable? How do you use one? And why would anybody want to? Let’s assume you have found a functional FGH calculator (e
), the hierarchy uses a "fundamental sequence" to choose a specific function based on the input : Standard Sequence : For the first limit ordinal , the sequence is usually 4. Code Implementation (Python Example) For instance, F_3(x) grows much faster than F_2(x),
Performing ( f_3(4) ) by hand is tedious. Performing ( f_ω+1(3) ) without a calculator is virtually impossible for a human. This is why we need a Fast Growing Hierarchy calculator .