Computing and Information Technology Interactive Digital Educational Library


Planet Math Computer Science  >
Planet Math Computer Science Collection >

Please use this identifier to cite or link to this item:

Title: Ackermann function
Issue Date: 30-Mar-2004
Publisher: PlanetMath
Abstract: Ackermann's function ... is defined by the recurrence relations ... Ackermann's function is an example of a recursive function that is not primitive recursive, but is instead mu-recursive (that is, Turing-computable). Ackermann's function grows extremely fast. In fact, we find that ... and at this point conventional notation breaks down, and we need to employ something like Conway notation or Knuth notation for large numbers. Ackermann's function wasn't actually written in this form by its namesake, Wilhelm Ackermann. Instead, Ackermann found that the
Appears in Collections:Planet Math Computer Science Collection

Files in This Item:

File SizeFormat

All items in DSpace are protected by copyright, with all rights reserved.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard - Feedback