User blog comment:Simplicityaboveall/Extremely Large Numbers 3/@comment-29014792-20160801191948/@comment-25912386-20160805080122

Deedlit11 ! You said :

" Chronolegends is correct.  Just look at the definitions; heshbar-n is the heshbar function iterated n times, just as f_{a+1}(n) is the f_a function iterated n times.  So if the heshbar function is comparable to f_a, then heshbar-n will be comparable to f_{a+1}(n). ".

f_a function iterated n times will just increase the ordinal by 1 !!! But the heshbar-n function increases the ordinal by a very very large amount when iterated only once. I encourage you as well as Chronolegends to understand. Thanks !