4 ms·
It's the Busy Beaver problem and BB-5 is proven ≥ 47176870. The list here would be the full list for any "up to n" database smaller than that.
by travisjungroth 4y ago
It's the Busy Beaver problem and BB-5 is proven ≥ 47176870. The list here would be the full list for any "up to n" database smaller than that.
- ttctciyf 4y agoI'm just highlighting that some sequences are not so easily generated. BB(n) is canonically awkward in this regard.