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

"Any function that grows faster(or as fast as) than any other uncomputable function is nessesarily uncomputable!" "There is NO computable function \(F(n)\) and/or uncomputable function \(U(n)\) for which \(U(n)<F(n)\) for a large enuff \(n\)" This is wrong. There are uncomputable functions which always takes values \(0\) or \(1\), hence is dominated by a constant function \(F(n)=2\).