Comments by "Zach B" (@zachb1706) on "Busy Beaver Turing Machines - Computerphile" video.

  1. Noncomputable because you don't know if any single busy beaver will halt. So you must manually determine which ones halt and then you can finally compute the input. I've seen this described as the "edge of computability"
    1