Mathematical induction is a method of proving that a statement holds true for all natural numbers by first proving it for the base case, then showing that if it holds for any given case, it must also hold for the next case. It can be extended to prove statements about more general structures and is used in mathematical logic and computer science.
University of Washington
Autumn 2021
CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.
No concepts data
+ 33 more concepts