User blog comment:DWither/Doubt about busy beaver/@comment-31966679-20180906002823/@comment-35392788-20180906103753

Well, it's actually uncomputable in finite time. An ITTM can solve the halting problem just fine. But even then, there are still functions even an ITTM can't compute. Namely, \(\Sigma_\infty(n)\).