User blog comment:Qq1010903229/Qq1010903229's Number/@comment-37652882-20191028230505/@comment-35470197-20191028235325

> i think iteration doesnt matter with functions like the busy beaver function though because to iterate an uncomputable function is only icing on the cake, so to speak.

It is not true. Uncomputable functions have great growth rate, but their values for specific small inputs are not necessarily larger than known computable large numbers. Remember that growth rate is the relation given by the eventual domination.

For example, imagine the size of C(10000) in his formulation. It is just given by a large number computed by a single C programme of realistic length. In order to make the size clearly significant, iterating the function is simply good. Remember why Rayo's number was not defined as Rayo(10000). The input should be at least exponential level.

> p

P is meaningful. Prime, place, point, prior, pure, positive, progress, potential, power, precious, pretty, and so on. You can regard it as whichever.