Previously the smallest known Turing machine with number of steps before halting greater than Graham's number had 13 states. Now a 10-state such machine seems to have been found!
(Personally I hope the newly found mathematical prowess of AI's can be put to productive and peaceful use of finding Busy Beavers, and solving numerous Busy Beaver-adjacent questions, beginning with BB(6) and the Collatz conjecture.)
Previously the smallest known Turing machine with number of steps before halting greater than Graham's number had 13 states. Now a 10-state such machine seems to have been found!
(Personally I hope the newly found mathematical prowess of AI's can be put to productive and peaceful use of finding Busy Beavers, and solving numerous Busy Beaver-adjacent questions, beginning with BB(6) and the Collatz conjecture.)