2 ms·
You know about busy beavers? These programs do fit in few bits, yet the number of states they can reach does not.
by rini17 5mo ago
You know about busy beavers? These programs do fit in few bits, yet the number of states they can reach does not.
- amavect 5mo agoOf course, I follow the bbchallenge project. That's like the distinction between 2^32, 4294967296, and a string of tally marks that cannot fit in this comment. In a pithy way, strict finitists prefer numbers as tally marks. I find value in that perspective.