3 ms·
Yeah, I was surprised the statement is constructed this way. Adding condition of eventual halting - which is what makes it the busy beaver - makes the differenc
by avmich 4y ago
Yeah, I was surprised the statement is constructed this way. Adding condition of eventual halting - which is what makes it the busy beaver - makes the difference :) .
- penteract 4y agoI think that this wording relies on carefully interpreting "before halting". A TM which runs forever can run more than 47 million steps, but it does not run more than 47 million steps steps before halting, since it never halts.
- tcosmo 4y agoI have changed the wording on the website in order to make it hopefully more straightforward: "This conjecture says that if a 5-state Turing machine runs for more than 47,176,870 steps without halting then it will never halt (starting from all-0 memory tape)."