Re:The 8000th Busy Beaver number eludes ZF set theory (2016)
by mafuy on Sunday May 06, 2018 @04:44AM
(#17005751)
Vaguely related, I implemented Busy Beavers in C#. It also has some support for automated proofs (i.e. making it run exponentially faster). It's open source at https://github.com/nerai/Nibbler
[ Parent
| on HN ]
There are no comments on this comment yet.