19 ms·
Induction isn't recursion. Induction is why recursion works. Unless you are assuming ZFC, which is much more comlplex then recursion itself, in second-order lo
by lupire 4y ago
Induction isn't recursion. Induction is why recursion works.
Unless you are assuming ZFC, which is much more comlplex then recursion itself, in second-order logic Induction is an axiom that we use to avoid recursion, by setting up the recursive step and then saying "so we don't have to execute it and look further"
Constructing the naturals is dynamic programming (building up), not recursion (breaking down).
Calculatiny addition using Peano axioms, that is recursion.
- analog31 4y agoWe hadn't gotten to those kinds of concepts in school by the time I learned recursion. The math that confounds programmers is much more basic.