User blog comment:JHeroJr/Can Someone Tell Me How To Create An Uncomputable Function That Is Not Naive?/@comment-34422464-20190623235738/@comment-35470197-20190624005548

Such an explanation is not good for beginners in uncomputable googology, because they have no idea how to formalise "can be described". Indeed, many beginners in this wiki had tried such an approach without understanding truth predicate, and they failed to create well-defined large numbers. If you really want to advice such a method, it is much better to quote how to formalise describavility or definability because it is not unique and heavily depends on the choice of an axiomatic system.