Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by schoen on Friday May 04, 2018 @12:33AM
(#16992212)
I'm not quite sure where you're going with this. The BB numbers are definitely regular integers in the same way that twelve or a googol is, but the uncomputability and fast growth of the function tend to "infect" other transformations and related functions, so that it also becomes very hard to say specific things about them.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by daxfohl on Friday May 04, 2018 @02:56PM
(#16997242)
Yeah I don't really know either. Something like if you name a number by saying BB(10000), but it's not computable, then have you actually named a number? But really that's just a boring question of how you referee the game.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by Scarblac on Friday May 04, 2018 @03:05AM
(#16992735)
Of course. The number of Turing machines is countable, so you can number them. HALT(n) is 1 when Turing machine halts and 0 when it doesn't.
Incomputable but always 0 or 1.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by Firadeoclus on Friday May 04, 2018 @05:46AM
(#16993323)
Except if you doubt that "when it doesn't halt" is an actual condition.
Though really that's what (computable.bb)(n) already is, in a far more interesting fashion. So really, never mind this.