Hacker News Reader

Combinatorial? Pff. Call me when your startup shows busy beaver growth.

Grow like TREE

[1] https://en.m.wikipedia.org/wiki/Kruskal%27s_tree_theorem

Busy 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.

Reply on news.ycombinator.com