User blog comment:Mush9/NOOP function/@comment-1605058-20161111205510/@comment-146.0.229.27-20161112183622

Interesting idea, but what if there are uncomputable functions which grow significantly slower than BB(n), but still uncomputable? (I think someone here can easily answer this question :D)