News for hackers. Stuff that matters.
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by bhelkey on Thursday May 03, 2018 @11:25PM (#16991995)
I think what the author is trying to get across is that BB(10000) would beat any large number generated through "conventional" means.

From the article: > BB(5) ≥ 47,176,870 > BB(23) > Graham’s number[1]

[1] https://en.wikipedia.org/wiki/Graham%27s_number

Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by remcob on Friday May 04, 2018 @04:27AM (#16993053)
How about BB(BB(10000))? I would call that conventional means, well-defined notation, etc. And I can keep going in this direction, creating ever larger numbers. (In fact, if space permits, I could define this sequence and then take the BB(10000)th element of this sequence.)
Re:The 8000th Busy Beaver number eludes ZF set theory (2016) by Sharlin on Friday May 04, 2018 @05:26AM (#16993256)
Of course you can go up the hierarchy, but BBⁿ(10000) is not "generated through conventional means" unless you take BB(10000) as given. And the point was that you're not given that.