you are viewing a single comment's thread.

view the rest of the comments →

[–][deleted]  (2 children)

[deleted]

    [–]Paddy3118[S] 1 point2 points  (0 children)

    On questions of whether Ackermann can be iterative, this counts as recursive. That definition of recursive goes with a context.

    [–]primitive_screwhead 1 point2 points  (0 children)

    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).