Re:BusyBeaver(6) Is Quite Large
by red75prime on Tuesday July 01, 2025 @02:30PM
(#44436771)
BB(748) has a single value. It is a finite number of steps (N) of some specific Turing machine. ZFC can't prove neither BB(748)=N, nor ~(BB(748)=N). But BB(748)=N is true and ~(BB(748)=N) is false anyway. The end.
[ Parent
| on HN ]
There are no comments on this comment yet.