Fast: Growing Hierarchy Calculator _top_

This gives a computable scheme once you can compute λ[n] from λ and n.

Choose between standard polynomial ordinals ( ), Cantor normal form ( ϵ0epsilon sub 0 ), or Veblen arrays. Input the Index ( fast growing hierarchy calculator

Note: A production calculator requires ordinal class systems and fundamental sequence dictionaries. This gives a computable scheme once you can

, which yields a massive integer over 5 million digits long. (using Knuth's up-arrow notation). : Entering the Transfinite fωf sub omega fast growing hierarchy calculator