Are you familiar with Ackermann function? Can you code for both recursive and non-recursive versions of it?

Question

Ackermann function:

| n+1 m=0
A(m,n) = { A(m-1,1) n=0
| A(m-1,A(m,n-1)) otherwise

"In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive." /Wikipedia/

Answer 1

you may check the following links,

https://gist.github.com/Sebbyastian/9bf5551f915b2694c77e

https://stackoverflow.com/questions/10742322/how-to-rewrite-ackermann-function-in-non-recursive-style