Introduction à la calculabilité et à la décidabilité (Computability Theory - Turing Machines) : La Sorbonne Université, Paris, France

January 2025 - May 2025

The classical notions of computability and decidability that form the foundations of computer science. These concepts are introduced progressively within a rigorous theoretical framework, allowing for a systematic approach to these questions. I presented finite automata, pushdown automata, and finally Turing machines, along with their functioning. The latter model was used to demonstrate the existence of undecidable problems. Link to the website of this class.

Discret Mathematics : La Sorbonne Université, Paris, France

September 2024 - December 2024

I taught this course to introduce the mathematical tools that form the foundation of techniques used across various areas of computer science. Many of the concepts covered were directly related to program termination, recursion, and compilation, while the second major theme focused on logic. For this latter part, we restricted our discussion to propositional logic, with more advanced topics covered in the dedicated third-year course. Topics covered: order relations and well-founded orders, induction on natural numbers, structural induction, models of computation and finite automata, recognizable and rational languages, and propositional logic. Link to the website of this class.

Mathematical Logic and Formal Logic: La Sorbonne Université, Paris, France

January 2024 - May 2024

I taught this course to introduce the mathematical tools and main notions of set theory, model theory, and proof theory for 2nd year bachelor's students with a major in mathematics or computer science.

Introduction to Algorithms: La Sorbonne Université, Paris, France

January 2023 - May 2023

I taught this course to introduce the mathematical tools and main notions algorithms for 2nd year bachelor's students with a major in mathematics or computer science. This class covered inductive proofs, mathematical trees, computational complexity and memory use, and some example of sorting algorithms.

Introduction to Coding: La Sorbonne Université, Paris, France

September 2022 - December 2022

First coding class (python) for 1st year bachelor's students with a major in computer science and electrical engineering.