In 2022 and 2024 (semester 2) I was the convenor (and co-convenor, respectively) of the course Foundations of Computing. Even though I convened the entire course and 2022 (but taught only the second in 2024), I only provide the slides of the second half, since I've revised them the most (already in two years), as I only want to provide high-quality material. (Note that the first half of the course has been replaced in 2024 and has thus never been revised, and never been delivered by me.)
The first six weeks (which are not provided) cover Hoare Logic and Structural Induction, in combination with Dafny. The second half (weeks 7 to 12) covers types of automata (DFAs to Non-deterministic TMs) and complexity theory. They can be regarded as an Introduction into the course Theory of Computation.
week 7: Deterministic Finite Automata (DFAs) (Slides)
week 8: Non-Deterministic Finite Automata (NFAs) and Regular Expressions (Slides)
week 9: Grammars and Push-down Automata (PDAs) (Slides)
week 10: Turing Machines (Slides)
week 11: Turing Machines: Limits of Decidability (Slides)
week 12: Problem Complexities (Slides)