Recursion in the Ackermann Function
Published in Wolfram Demonstrations Project • Apr 28, 2007
NobleIDNI8P75W32R99S82
Abstract
The Ackermann function is a classic example of a function that is not primitive recursivemdashits evaluation cannot be unwound into simple loops See how instances of the Ackermann function get evaluated by calling on others The Ackermann function grows very rapidly As its first argument increases it...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!