I 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 m

I 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)."