Busy Beaver Numbers are Undecidable

Here we show that Busy Beaver numbers are undecidable.
If you like this content, please consider subscribing to my channel: / @easytheory
▶SEND ME THEORY QUESTIONS◀
[e-mail]
▶ABOUT ME◀
I am a professor of Computer Science, and am passionate about CS theory. I have taught many courses at several different universities, including several sections of undergraduate and graduate theory-level classes.

[@kenwarner]

can we get an update

[@AliverTwisted]

Thank you for this great video

[@EasyTheory]

You're welcome!

[@drdkwilson]

This is not based on the assumption that the BB problem has only one halt state. The reduction should be to Halt.