The question Is busy beaver the fastest growing function known to man? is answered negatively, pointing out that arbitrarily fast growing functions can be constructed.
But is there a "reachable" lower bound for uncomputable functions, or can the growth rate be just e.g. endlessly halved while still remaining uncomputable?
