Description: Ackermann function (Ackerman) examples of non-primitive recursive function it takes two natural numbers as input, output a natural number. Its output value growth rate is very high, only (4,3) output has been so large that can not be accurately calculated. Ackerman function is defined as follows: If m = 0 return n+1 if m> 0 and n = 0 return Ackerman (m-1, 1) if m> 0 and n> 0 return Ackerman (m-1, Ackerman (m, n-1))
To Search:
File list (Check if you may need any files):
阿克曼函数（Ackerman）\阿克曼函数.doc
......................\Ackerman.cpp
阿克曼函数（Ackerman）
Download