| 释义 |
backward induction The contrapositive form of mathematical induction which shows that if the proposition P(n) fails then the proposition must fail for some P(k), for some k ≤ n−1. As with the standard form of induction, if P(1) is true, this means that P(2) must also be true and so on.
|