Ackermann function

In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest[1] and earliest-discovered examples of a total computable function that is not primitive recursive. All primitive recursive functions are total and computable, but the Ackermann function illustrates that not all total computable functions are primitive recursive.

After Ackermann's publication[2] of his function (which had three non-negative integer arguments), many authors modified it to suit various purposes, so that today "the Ackermann function" may refer to any of numerous variants of the original function. One common version is the two-argument Ackermann–Péter function developed by Rózsa Péter and Raphael Robinson. Its value grows very rapidly; for example, results in , an integer of 19,729 decimal digits.[3]

  1. ^ Monin & Hinchey 2003, p. 61.
  2. ^ Ackermann 1928.
  3. ^ "Decimal expansion of A(4,2)". kosara.net. August 27, 2000. Archived from the original on January 20, 2010.

From Wikipedia, the free encyclopedia · View on Wikipedia

Developed by Nelliwinne