Whence function notation?

The Occasional Pamphlet 2015-12-22

Summary:

I begin — in continental style, unmotivated and, frankly, gratuitously — by defining Ackerman’s function \(A\) over two integers: \[ A(m, n) = \left\{ \begin{array}{l} n + 1 & \mbox{ if $m=0$ } \\ A(m-1, 1) & \mbox{ if $m > 0$ and $n = 0$ } \\ A(m-1, A(m, n-1)) & \mbox{ if $m […]

Link:

http://blogs.harvard.edu/pamphlet/2015/09/28/whence-function-notation/

From feeds:

Berkman Center Community - Test » The Occasional Pamphlet

Tags:

computer science

Authors:

Stuart Shieber

Date tagged:

12/22/2015, 16:15

Date published:

09/28/2015, 14:28