> In fact, iteration is (provably) just one case of recursion.

Does this proof take into account the memory usage of stack frames in recursion?

> Those problems that are iterable are also easy to optimize in functional languages using a tail recursion.

This statement might or might not be true, but it is not trivially obvious that it should be. Please back up this claim.