Recursive definitions are used to define functions and sets in mathematics and computer science. They involve defining a function or set in terms of itself, often using an induction principle to prove properties of the function or set. Examples include factorials, natural numbers, Fibonacci numbers, and the Cantor ternary set.

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