Fast Growing Hierarchy Calculator — 'link'

To compute (f_\alpha) for a limit ordinal (\alpha), we need a —a strictly increasing sequence of ordinals whose supremum is (\alpha). For the Wainer hierarchy (ordinals below (\varepsilon_0)), the sequences are standard:

: a Python implementation of the Wainer hierarchy that tries to compute the functions strictly according to the recursive definition. The author notes that “for almost all input values this function will never return any value as the runtime will be far too long,” but the code is intended to be a faithful computational model of the concept. fast growing hierarchy calculator