>>7
yeah, nevermind, I should have said by induction on the value of a function applied to the arguments (like the length of a list, or height of a tree or something).
No, that's still incorrect.
Trying to do it by induction on the number of recursive calls isn't going to be very successful if there is infinite recursion,
Yes it will. I believe this is called functional programming you etard.
But the idea is that every recursive call brings you closer to the solution.
No. That is called approximation, not recursion.