3 ms·
If you like the Ackerman function you're gonna love Kruskal's tree theorem. https://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem https://en.wikipedia.org/wik
by lisper 7y ago
If you like the Ackerman function you're gonna love Kruskal's tree theorem.
https://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem https://en.wikipedia.org/wiki/Kruskal%27s_tree_theorem
- fossuser 7y agoThis essay is also great if you like this kind of thing: https://www.scottaaronson.com/writings/bignumbers.html https://www.scottaaronson.com/writings/bignumbers.html
- danbruc 7y agoOr this page [1] on large numbers. [1] https://mrob.com/pub/math/largenum.html https://mrob.com/pub/math/largenum.html
- jdkee 7y agoOr Friedman’s SSCG function.
- lisper 7y ago> "SSCG(3) is much, much larger than both TREE(3) and TREE^(TREE(3))(3) (the TREE function nested TREE(3) times with 3 at the bottom)" Holy freakin' cow. And the busy beaver sequence grows faster than that. My mind is well and truly boggled.