50MB Stack Memory vs Recursive Boi

WHO WOULD WIN? 50MB OF THE STACK MEMORY ONE RECURSIVE BOI >java -Xss50M Ackermann 5 1 A(m,n) = { n + 1 if m = 0; A(m − 1, 1) if m > 0 and n = 0; A(m − 1, A(m,n − 1)) if m > 0 and n > 0. }

A programming meme presents a showdown between 50MB of stack memory and one recursive function call computing the Ackermann function. The joke is that Ackermann recursion grows so explosively that even a large stack allocation is no match for it, making it a reaction to recursion, stack overflow, or inefficient code. EN: A programming meme presents a showdown between 50MB of stack memory and one recursive function call computing the Ackermann function. The joke is that Ackermann recursion grows so explosively that even a large stack allocation is no match for it, making it a reaction to recursion, stack overflow, or inefficient code.

• @profunctor_io / 2554 2019-07-09