Category:Ackermann function

From LiteratePrograms
Jump to: navigation, search

The Ackermann function or Ackermann-Péter function is defined recursively for non-negative integers m and n as follows:

 A(m, n) =
 \begin{cases}
 n+1 & \mbox{if } m = 0 \\
 A(m-1, 1) & \mbox{if } m > 0 \mbox{ and } n = 0 \\
 A(m-1, A(m, n-1)) & \mbox{if } m > 0 \mbox{ and } n > 0.
 \end{cases}

In the theory of computation, the Ackermann function is a simple example of a recursive function that is not primitively recursive. Note that this function grows very quickly -- even A(4, 3) cannot be feasibly computed on ordinary computers.

hijacker
hijacker
hijacker
hijacker

Pages in category "Ackermann function"

The following 5 pages are in this category, out of 5 total.