User blog comment:Simplicityaboveall/Extremely Large Numbers 2/@comment-5529393-20160801203256/@comment-25912386-20160803183624

" The strongest ordinal notations in the literature only go up to a small fragment of second order arithmetic, whereas the Calculus of Constructions can express functions that are not provably recursive in nth order arithmetic for any n."

Deedlit11 ! Could you please give some examples of the stongest ordinal notations.

Also , PsiCubed said :

"  Regarding the question of heshbar-q and Rayo, let me put it this way:

heshbar-q(Rayo(10^100)) < Rayo(10^100 + 1)

This is true for any computable function."

Do you agree with him ?