I think recursion is easiest to understand as syntactic sugar for stack manipulation. It always terminates because stacks have finite size. I don't see the poin

I think recursion is easiest to understand as syntactic sugar for stack manipulation. It always terminates because stacks have finite size. I don't see the point of having an "elegant" mathematical definition of something when it's unrelated to real hardware.