Hi, I've been introudeced to maple today and we were asked to think about how we'd write a two argument Ackermann code. I appreciate that computing power can lead to problems when workin gout this kind of recursive problem. I've done a bit of reading around but no joy on the maple front to be honest.

I thought the code may look like something like this but it's not right. Any thelp would be greatly appreciated!

# Ackermann-Peter function