4 ms·How many times on HN must this topic come up?by ipunchghosts 10y agoHow many times on HN must this topic come up?_ao789 10y agoTo understand recursion, you must first understand recursion.gumby 10y agoWhile to understand iteration, just keep studying until you're done.catnaroek 10y agoBut you still need to use recursion to prove that, in fact, you will eventually be done.hinkley 10y agoHalt! I see a problem.pjscott 10y agoYou should halt if and only if you know you'll never halt.deleted 10y ago[deleted]catnaroek 10y agoBy “recursion”, I didn't mean a “recursive algorithm”, but rather “induction on the loop counter” (a proof technique). Since proofs aren't meant to “run”, they don't need to “halt”.