Higher computable level

This category contains computable numbers that cannot be estimated using fast-growing hierarchy in the form f_α(n) with α made from Bachmann's ordinal collapsing function and reasonably small values of n, because they go beyond fast-growing hierarchy with Bachmann's ordinal collapsing function.

The lower bound of this category is \(f_{\psi_0(\varepsilon_{\Omega+1})}^2(10) = f_{\psi_0(\psi_2(0))}^2(10)\) with respect to Buchholz's function.