Write the ackerman function, which conforms to 3 constraints:
ack(0, n) = n+1
ack(m, 0) = ack(m-1, 1)
ack(m, n) = ack(m-1, ack(m, n-1))
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers27
Suggested Problems
-
572 Solvers
-
673 Solvers
-
Integer Sequence - II : New Fibonacci
690 Solvers
-
164 Solvers
-
Matrix of almost all zeros, except for main diagonal
191 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
See also Cody Problem 734.