User blog comment:JHeroJr/A computable function/@comment-35470197-20190623231332/@comment-35470197-20190624011330

In order to avoid such ill-definedness based on natural-language-based arguments without formalisation in mathematics, I recommend you to use stuffs whose precise definition you actually know. For example, what is the definition of "can be described with \(n\) symbols"? In mathematics, everything should be defined by formula. On the other hand, when you try to formalise "can be described with \(n\) symbols" into formula, then you will soon find that it does not make sense by yourself.

In particular, it is better to write down the explicit computation rules when you are working in computable googology. Then you will soon understand whether it is computable or not. If you have no idea to describe the computation, then it is reasonable for you to doubt the computability.