Most of the time, people explain recursion by calling the same function repeatedly.
So notice, we've gotten to this base case, which is zero.
Examples of generative recursion include: , , , , , , and.
And this would never end right.
These abilities are not just a matter of being able to respond verbally to novel circumstances, but of being capable of expressing novel propositions, and of re-expressing familiar propositions in new ways.
Let's look at Fibonacci, a classical, mathematical and computer science problem that often demonstrates the power of recursion.