User blog comment:Wythagoras/My Turing machines/@comment-6768393-20131012123348/@comment-10429372-20131013063400

I've made an ordinal notation which might reach second order arithmetic, and dollar function does the same. In the current version, even the limit of &2 brackets reach the limit of compact ordinal notation. Loader.c is in a whole different universe, since it is not expressible in nth order arithmetic for any n. Still, I think BB(100) > Loader's Number and BB(25) > f_e_0(n) for very large n.