Any problem that can be solved recursively can also be solved iteratively.

Question

Quizplus · Accepted Answer

This is known as the "recursion theorem" or "Church's thesis" and is a fundamental principle in computability theory. It states that any computation that can be performed using recursive functions (i.e. functions that call themselves) can also be performed using iterative functions (i.e. loops). However, the reverse is not necessarily true, as there are some problems that can only be solved recursively.

Any Problem That Can Be Solved Recursively Can Also Be