Lectures related to Computability theory

Explores countability and undecidable problems in the theory of computation.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Introduces recursively defined functions, showcasing examples like the Fibonacci numbers.

Explores Fibonacci numbers, rabbit population growth, and recursively defined functions.

Explores the theoretical definition of computation and introduces Turing machines.

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.