User blog comment:Simplicityaboveall/Extremely Large Numbers 2/@comment-5529393-20160801203256/@comment-28633611-20160804043657

Yup, Deedlit. That's what I meant.

It should be noted, though, WHY using a function like f(x) = constant = Rayo(10^100+2) doesn't count:

Any Turing Machine which is capable of computing f(x) will need to have about Rayo(10^100+2) states. And no kind of computable recursion, however ingenious, can improve this by any substantial amount.

Basically, there are only two ways to write down a computable function which will not obey the inequality I've given earlier:

1. Make your definition longer than Rayo(10^100) characters.

2. Invoke uncomputable methods in your definition (like we've done with f above).