News for hackers. Stuff that matters.

A comment on BusyBeaver(6) Is Quite Large. Parent comment

Re:BusyBeaver(6) Is Quite Large by Scarblac on Sunday June 29, 2025 @04:33AM (#44411311)
What happens if you take the larger of a and b and run all the Turing machines for that many steps?
[ Parent | on HN ]
Re:BusyBeaver(6) Is Quite Large by thaumasiotes on Sunday June 29, 2025 @12:56PM (#44414530)
What are a and b?
[ Parent | on HN ]
Re:BusyBeaver(6) Is Quite Large by josephcsible on Monday June 30, 2025 @04:01PM (#44427228)
Does it matter? My reading is basically "if you have two distinct candidates, isn't that a way to always disprove at least one of them?"
[ Parent | on HN ]
Re:BusyBeaver(6) Is Quite Large by Kranar on Sunday June 29, 2025 @03:11PM (#44415507)
Among all possible values of BB(n) for some fixed n, it's the smallest such value that is the true value.

The issue is that there is no way within ZFC to determine which value is the smallest.

[ Parent | on HN ]