User blog comment:Googleaarex/My number is bigger! (Googology Wiki version)/@comment-10429372-20140922094937/@comment-1605058-20140922134210

How do you define Kolmogorov complexity for uncomputable functions? We would need a writing system which would give us definitions. If we choose natural language, e.g. English, we quickly run into paradoxes. If we use FOST, we get a function highly similar to Rayo(n), and not beating it significantly. We would need some higher order language, like my MOST, for this definition to have significant strength.