We outline the course, its goals, and talk about various administrative issues.

We begin by reviewing a few simple proofs of numerical properties by mathematical and complete induction and infer their distinguishing factor as the necessary fallback on a base case. We use this observation to give a computational expression to the participating entities as inductive function definitions. We conclude by discussing the differences between inductively defined functions and recursive functions.