Teaching

2023 - 2024

  1. Computability Theory and Applications. Course taught at ENS Lyon. The aim of this course is to give a solid background on computability theory, by covering the basic notions (Church-Turing thesis, Turing degrees, Pi^0_1 classes, the arithmetic hierarchy, hyperimmunity, finite extension method and priority constructions) but also more advanced topics. Webpage

2016 - 2017

  1. Incompleteness and Undecidability. Spring 2017. Course taught at UC Berkeley. This class covers Gödel's incompleteness theorems, Turing machines, Rice theorem, recursively enumerable sets, among others.
  2. Introduction to Abstract Algebra. Fall 2016. Course taught at UC Berkeley. This class covers group theory, commutative rings, ideals, fields, fields extensions, among others.
  3. Introduction to Analysis. Fall 2016. Course taught at UC Berkeley. This class covers sequences, limits, continuous functions, uniform convergence, infinite series and the Riemann integral, among others.

2014 - 2015

  1. Lab sessions: Internet et Outils IO2. Second semester. Course taught at Paris 7 by Christophe Prieur. This class covers HTML, CSS, PHP and Javascript.

2013 - 2014

  1. Lab sessions: Langage C. Second semester. Course taught at Paris 7 by Jean-Marie Rifflet . This class covers basic structures, pointers, libraries and related tools.
  2. Lab sessions: Initiation à la programmation IF1. First semester. Course taught at Paris 7 by Matthieu Picantin. The aim of this class is to make discover basics of procedural programming using Java.