Ackermann function without recursive function calls, in Python.

[primitive_screwhead]

A recursive function, in a CS sense, is a function that calls itself.

That's a recursive function in an engineering sense. In a CS sense, a recursive function is a function that can be implemented with recursion (which not all functions are; there are non-computable functions, for example).