User blog comment:Nedherman1/HDXT/@comment-35811215-20180611011729/@comment-25601061-20180611014323

The best way to do so is recursion and diagonalization.

Recursion is when you make a function iterate another one (e.g F(x) = G(G(G(...G(x)...))) with x applications of G) and diagonalization is when you make a function pick another function from some set of functions (e.g F(x) = Fx(x), where Fn is the nth member of some set of functions)

Growth rate of the number will increase naturally if the growth rate of the notation used in the number is increased.