The fast-growing hierarchy consists of several functions, each denoted by a Greek letter (usually ω or Ω). The functions are defined recursively, with each function growing faster than the previous one. Here are the first few functions in the hierarchy:

, which are the "instructions" for breaking down complex ordinals like epsilon sub 0 Mathematics Stack Exchange Golf the fast growing hierarchy - Code Golf Stack Exchange

if __name__ == "__main__": main()

A calculator for this hierarchy allows users to input an ( ) and a natural number (