- #1
johnkclark
- 21
- 2
We know for sure the first four Busy Beaver numbers exist are finite and are computable because they have in fact been computed, they are 1,6,21 and 107. And we know for sure that the 7918th Busy Beaver number exists and is finite but is NOT computable thanks to the work of Scot Aaronson, but it would be really nice if that gap between 4 and 7918 could be narrowed. I'd really like to know what the smallest non computable Busy Beaver number is, but even that may be non computable. Does anybody know?
John K Clark
John K Clark