This category contains numbers that can be defined or estimated using fast-growing hierarchy in the form fα(n) with α made from polynomial of ω and reasonably small values of n, which is roughly equivalent to Jonathan Bowers' linear array.

The lower bound of this category is \(f_{\omega^3}(10^{10^6})\), and the upper bound is \(f_{\omega^\omega}(10^{10^6})\).

All items (263)

Community content is available under CC-BY-SA unless otherwise noted.