0

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

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/

2nd Oct 2017, 7:48 AM
Louie Jon Antuine
Louie Jon Antuine - avatar
1 Antwort