4 ms·
Combinatorial? Pff. Call me when your startup shows busy beaver growth.
by riwsky 5y ago
Combinatorial? Pff. Call me when your startup shows busy beaver growth.
- legobmw99 5y agoGrow like TREE [1] https://en.m.wikipedia.org/wiki/Kruskal%27s_tree_theorem https://en.m.wikipedia.org/wiki/Kruskal%27s_tree_theorem
- AlotOfReading 5y agoBusy Beaver grows faster than TREE, SSCG and every other function in the fast-growing hierarchy. The latter are computable, while the former is uncomputable and (eventually) grows faster than any computable function.