If you like the Ackerman function you're gonna love Kruskal's tree theorem.
This essay is also great if you like this kind of thing: https://www.scottaaronson.com/writings/bignumbers.html
Or this page [1] on large numbers.
Or Friedman’s SSCG function.
> "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.
I'm not strong on mathematics but I've been able to enjoy the historical overview and references. I agree with you on how amazing the work is.
Re:Man or boy test
by tempguy9999 on Thursday November 28, 2019 @10:06AM
(#21657807)
I've read the wiki page and still don't get what the big deal is about the ackermann function. Can someone explain? TIA
That said, this procedure is a doozy. It reminds me of the Ackermann function but doesn't quite grow as fast (understatement).