User blog comment:LittlePeng9/Long hierarchies of functions (on my other blog)/@comment-2607:FB90:5F0D:D723:AF57:6A2E:9253:666-20180318183730

What's the difference between function computation and function growth rate? How do the 2 relate? How does the Halting problem go beyond recursion? How does the Halting problem relate to function growth rate? How does the Church-Kleene Ordinal relate to Turing machines?