Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by daxfohl on Friday May 04, 2018 @12:18AM
(#16992154)
Well so BBOBBSQUARED or whatever. The point being that it's conceivable to define a simple function that is not computable yet has a simple result.
Though really that's what (computable.bb)(n) already is, in a far more interesting fashion. So really, never mind this.
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.
Sure, although BB(3) is already larger than 5 and every BB number is much larger than the previous one, so the specific estimate of 5 is probably going to be more of an understatement than almost anything anyone has ever said. :-)
> (And while "Aha: BB(10000) is NOT 5", one could make some function BBOBB(N) := BB(N)/BB(N-1), and maybe BBOBB(N) for whatever reason is 5 for some large N, but is not computable and thus can't be proven so. Or something like that. Which also takes some of the drama away).
BBOBB(N) also grows faster than any computable function, and for N≥4, BB(N+1)>BB(N)². So also it's not going to be 5 for any large N.