The Recursion Theorem is a mathematical theorem which states that any computable function can be defined using a fixed set of rules. It is an important result in computability theory and has applications in many areas of mathematics. It is also known as the Kleene-Rosser Paradox.

A foundational course that introduces formal languages, automata, computability, and complexity theories, including finite automata, Turing machines, and P/NP classes.