neatchee

Logically terminating resources does not imply a terminating logic loop. Clever wordplay, though.

Recursion has a specific definition. It means solving a problem by breaking a process down into smaller and smaller self-similar pieces until reaching the “base case”. In programming, it (almost) always means a function that calls itself as part of its internal logic. Depending on what the function does and the conditions for returning a value from the function, it may do that one time, many times, or not at all. A classic example is the Boggle solver.

I did say I was being pedantic :P

Not to be pedantic, and I do appreciate the humor, but that’s not recursion either :3 Recursion doesn’t need to be endless. Recursive functions can absolutely have logical termination.