Re:How recursion got into programming: a comedy of errors
by groovy2shoes on Wednesday July 23, 2014 @02:01PM
(#8075853)
That is correct, but recursion in the lambda calculus is emergent from the rules, not a rule in itself.
Re:How recursion got into programming: a comedy of errors
by andreasvc on Thursday July 24, 2014 @06:57AM
(#8078958)
Mathematical induction is not controversial, it is a formally correct method of proof. You may be thinking of the unrelated concept of empirical induction: generalizing from finite data (black & white swans etc).
My understanding was that without recursion the lambda calculus is not Turing-complete. Is that correct?
It should also be noted that recursion is a close relative of induction, an indispensable tool that is not without its own problematic history.