User blog comment:Mush9/Beyond BIG FOOT (ideas in comments)/@comment-30118230-20161106180718

It is impossible to beat BIG FOOT with a computable number or function!

Here is why:

-Any function that grows faster(or as fast as) than any other uncomputable function is nessesarily uncomputable!

-Any notation made by a human in a finite amount of steps is nessesarily computable and thus is eventualy dominated by all uncomputable functions!

-There is NO computable function \(F(n)\) and/or uncomputable function \(U(n)\) for which \(U(n) < F(n)\) for a large enuff \(n\)