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
-
14110 Solvers
-
315 Solvers
-
Vectorize the digits of an Integer
338 Solvers
-
Sum of the Multiplication of Vectors
286 Solvers
-
Calculate solution of given polynomial
97 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.