Search results
Jump to navigation
Jump to search
Page title matches
- In [[computability theory]], the '''Ackermann function''' or '''Ackermann-Péter function''' is a simple example of a [[computable The Ackermann function is defined [[recursion|recursively]] for non-negative integers ''m'' and ''2 KB (302 words) - 06:37, 13 September 2013
- 362 bytes (58 words) - 05:15, 2 February 2009
- Auto-populated based on [[Special:WhatLinksHere/Ackermann function]]. Needs checking by a human.433 bytes (55 words) - 07:43, 8 January 2010
Page text matches
- #redirect [[Ackermann function/Definition]]43 bytes (4 words) - 05:16, 2 February 2009
- In [[computability theory]], the '''Ackermann function''' or '''Ackermann-Péter function''' is a simple example of a [[computable The Ackermann function is defined [[recursion|recursively]] for non-negative integers ''m'' and ''2 KB (302 words) - 06:37, 13 September 2013
- Auto-populated based on [[Special:WhatLinksHere/Ackermann function]]. Needs checking by a human.433 bytes (55 words) - 07:43, 8 January 2010
- Ackermann Function5 KB (668 words) - 21:17, 2 November 2013
- Ackermann Function4 KB (444 words) - 02:34, 14 August 2009
- </ref>, and various [[superfunction]]s, including the [[Ackermann function]]s.9 KB (1,388 words) - 11:08, 20 November 2011
- <!-- This table is quite similar to the [[Ackermann function]]s, but, historically, the Ackermann functions have some displacement in it ===Relation with the [[Ackermann function]]===65 KB (10,203 words) - 04:16, 8 September 2014