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 Solvers29
Suggested Problems
-
Vectorize the digits of an Integer
338 Solvers
-
565 Solvers
-
Celsius to Fahrenheit converter
674 Solvers
-
716 Solvers
-
Side of an equilateral triangle
7118 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.