Re:BB(3, 3) is Hard
by noqc on Tuesday October 17, 2023 @12:40AM
(#37910701)
If BB is a computable function, then you can solve the halting problem by running every turing machine on n symbols for BB(n), and the ones that don't halt by then don't halt at all.
[ Parent
| on HN ]
There are no comments on this comment yet.