Re:Show HN: Angelic-hierarchy, a game about Turing machines,...
by modalduality on Wednesday November 29, 2017 @01:36PM
(#15809483)
In case you think you've figured out the 2-state solution and you want to check that you can't do better, I've uploaded the number of 1s your machine should output at https://modalduality.org/static/busy-beaver-2.txt, but did not include the actual configuration.
[ Parent
| on HN ]
Re:Show HN: Angelic-hierarchy, a game about Turing machines,...
by mlillie on Wednesday November 29, 2017 @04:32PM
(#15811069)
I'm confused, because this answer seems to contradict what "a little grunt work will ascertain" in the article you linked as inspiration
Re:Show HN: Angelic-hierarchy, a game about Turing machines,...
by modalduality on Wednesday November 29, 2017 @07:26PM
(#15812232)
Ah, so Aaronson is talking about the Busy beaver shifts function of 2 there. I gave the answer to the busy beaver function counting the maximum number of 1s.