User blog comment:Ikosarakt1/Inverse busy beaver function/@comment-1605058-20140311153328/@comment-5150073-20140311155345

That is, like we can't give a computable upper bound for $$\Sigma(n)$$, we can't give a computable lower bound for $$\Sigma^-1(n)$$.