![](https://moodlearchive.epfl.ch/2022-2023/pluginfile.php/1599834/course/overviewfiles/Screenshot%202021-09-22%20at%2013.08.05.png)
This course constitutes an introduction to theory of computation and basics of complexity theory. It discusses the basic theoretical models of computing (finite automata, Turing machines), as well as, provides a solid and mathematically precise understanding of their fundamental capabilities and limitations.
- Professor: Mika Göös
- Professor: Nathaniel Idein Harms
- Professor: Alexandros Hollender
- Professor: Gilbert Théodore Maystre
- Teaching Assistant: Jérémy Valentin Barghorn
- Teaching Assistant: Lindsay Bordier
- Teaching Assistant: Yassine Chami Khazraji
- Teaching Assistant: Robinson Dinh Huy Cung
- Teaching Assistant: Yann Ennassih
- Teaching Assistant: Bastien Faivre
- Teaching Assistant: Amaury Olivier Marie-Josèphe George
- Teaching Assistant: Bryan Marcel Gotti
- Teaching Assistant: Ziyi Guan
- Teaching Assistant: Selim Jerad
- Teaching Assistant: Anastasiia Kucherenko
- Teaching Assistant: Paul Serge André Marchi
- Teaching Assistant: Kamil Mellouk
- Teaching Assistant: Artur Riazanov
- Teaching Assistant: Théo Edouard Schifferli
- Teaching Assistant: Mike Junior Sinsoillier
- Teaching Assistant: Anastasiia Sofronova
- Teaching Assistant: Thomas Srour
- Teaching Assistant: Miltiadis Stouras
- Teaching Assistant: Lukas Vogl
- Teaching Assistant: Weiqiang Yuan