Learning objectives
To have an overview of the theoretical aspects of Computer Science.
Description of the programme
Language theory (regular languages, algebraic languages, decidable languages, recognizable languages)
Turing machines, finite automata, stack automata, bounded automata, computability.
Complexity theory (time complexity, space complexity, probabilistic complexity classes, Kolmogorov complexity)
Generic central skills and knowledge targeted in the discipline
Curiosity & reflection.
How knowledge is tested
Final examination
Teaching team
- Pascal Préa
Sustainable Development Goal
_max90x90.png?objectId=content://f14a4ca6-cad5-4946-a81b-17e22ffbf9e5)
Gender equality
Life below water
- Total hours of teaching24h
- Master class20h
- Directed work4h