Re:How the Slowest Computer Programs Illuminate Math’s Funda...
by boloust on Friday December 11, 2020 @07:27AM
(#25384992)
For an n-sized program, run it for BB(n) steps. If it hasn't halted then by definition it will never halt.
[ Parent
| on HN ]
There are no comments on this comment yet.