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
- Teaching Assistant: Antoine Bruno Colson
- Teaching Assistant: Madeline Chantal Dominique Desautel
- Teaching Assistant: Adrien Jean Deschenaux
- Teaching Assistant: Zijing Di
- Teaching Assistant: Pierre Folke Fasterling
- Teaching Assistant: Ziyi Guan
- Teaching Assistant: Valentin Imbach
- Teaching Assistant: Ekaterina Kochetkova
- Teaching Assistant: Fedor Mitirev
- Teaching Assistant: Martin Pierre Alain Muchembled
- Teaching Assistant: Georgios Nikolaou
- Teaching Assistant: Hristo Georgiev Papazov
- Teaching Assistant: Artur Riazanov
- Teaching Assistant: Anastasiia Sofronova
