User blog:KthulhuHimself/The Rho function.

This time, I will be looking at a function which I cannot be sure wherever it is computable or not.

On the one hand, it eventually dominates all other computable functions, yet on the other hand, it most likely can be computed by modern computers (probably not by a turing machine, though).

The Rho function is defined as follows if it is uncomputable:

Rh(n) = The largest output of a computer program in language c, with n symbols or less.

And is defin ed as follows if it is computable:

Rh(n) = The largest output of a computer program in language c, that does not work by the principles of the Rho function, with n symbols or less.

Obviously, Rh(520) is already larger than loader's number, and for sufficiently large n, Rh(n) will dominate even finite promise games, and even greedy clique sequences.