←back to thread

BusyBeaver(6) Is Quite Large

(scottaaronson.blog)
271 points bdr | 6 comments | | HN request time: 0s | source | bottom
Show context
Scarblac ◴[] No.44406478[source]
It boggles my mind that a number (an uncomputable number, granted) like BB(748) can be "independent of ZFC". It feels like a category error or something.
replies(12): >>44406574 #>>44406590 #>>44407165 #>>44407378 #>>44407396 #>>44407448 #>>44407506 #>>44407549 #>>44408495 #>>44409048 #>>44410736 #>>44413092 #
Straw ◴[] No.44406590[source]
The category error is in thinking that BB(748) is in fact, a number. It's merely a mathematical concept.
replies(7): >>44406641 #>>44406756 #>>44406982 #>>44407096 #>>44407244 #>>44407342 #>>44428546 #
1. dtech ◴[] No.44406982[source]
It's as much a number as 12
replies(1): >>44407039 #
2. lupire ◴[] No.44407039[source]
Only if you believe that a number you can't count is a number. You can believe that, but it's a leap.
replies(1): >>44407274 #
3. falcor84 ◴[] No.44407274[source]
Couldn't you make the same argument for sqrt(2), or better yet for zero [0]?

[0] https://en.wikipedia.org/wiki/Zero:_The_Biography_of_a_Dange...

replies(2): >>44407319 #>>44428624 #
4. Dylan16807 ◴[] No.44407319{3}[source]
For sqrt(2) I can tell you the order of magnitude and output as many digits as you want. I think that's plenty specific for this use case.

For zero I can not only do that, I can also count to it if you let me count both up and down, which seems like a very simple ask.

replies(1): >>44408632 #
5. falcor84 ◴[] No.44408632{4}[source]
But that's the thing - each generation struggles with whether some new thing is a number. We're typically very inclusive, accepting imaginary numbers and even weirder things like surreal numbers, which we definitely can't count.

But as someone in this generation, I see a good argument for rejecting the big busy beaver numbers, which are provably outside of the realm of calculating with all the resources of our universe's runtime, from being fully accepted as numbers, any more than the first uninteresting number [0].

[0] https://en.wikipedia.org/wiki/Interesting_number_paradox

6. Straw ◴[] No.44428624{3}[source]
sqrt(2), and pretty much everything else you can think if, is computable- there's a program that can output rational numbers arbitrarily close.

BB(n) is not.