Problem 46591. Ackerman Function
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
ChrisR
on 19 Sep 2020
See also Cody Problem 734.
Solution Comments
Show commentsProblem Recent Solvers27
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6668 Solvers
-
Similar Triangles - find the height of the tree
463 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
882 Solvers
-
236 Solvers
-
6271 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!