Edit: Not sure why this got downvoted, but in their internal programming course they talked about the recursion problem explicitly--I'm not making this up, as crazy as it sounds.
If you don't believe me, here is a link to a blog post with someone else mentioning it in the comments:
http://htmlcoderhelper.com/what-is-the-worst-programming-lan...
edit: rather than downmod me to -1 for stating a fact, why not reply?
Possibly it makes things easier for some algorithms, but as I said, it is optional. It's not rocket science to rewrite any algorithm that relies on recursion to not need it.
I can't do it justice, but it's definitely much more interesting and even beautiful than "meh". I guess there are always "practical" vs "academic" arguments to be made but I find stuff like the lambda calculus, Y, Church numerals, all really cool.
I've always been more of a practical "why not just use a loop" kinda guy, so it's probably wasted on me.
It seems to me logical for both parties to express programs mostly using loops.
There's a lot of difference in the unoptimized form of recursion - namely stack usage. Yes you can hack together tail call recursion to try and make recursion perform as well as iteration does, but what really is the point?
Loops are a just a special case, and not really closer to the hardware. Branches and jumps are closer to the hardware. "Yes you can hack together [a compiler] to try and make [structured programming] perform as well as [goto] does, but what really is the point?"
Above is a very hard sentence to parse for non-native speakers, just saying ;)
This is a good description if you're into that sort of thing: http://mvanier.livejournal.com/2897.html
The meat of it is that you can 'do' recursion by building up functions that call other functions :/ meh