 | Study programme 2023-2024 | Français | |
| Computability and Complexity | |||
Learning Activity |
| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) | Establishment |
|---|---|---|---|---|
| S-INFO-023 |
|
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 30 | 30 | 0 | 0 | 0 | Q1 |
Content of Learning Activity
Automata, Turing machines, decidable problems, recursively enumerable problems, complexity classes, NP-completeness.
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
- Theoretical Computer Science, J. Hromkovic, Springer, 2004
- Introduction to the theory of computation, M. Sipser, PWS publishing company, 2005
Mode of delivery
- Face-to-face
Type of Teaching Activity/Activities
- Cours magistraux
- Exercices dirigés
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)
Location of learning activity
- Université de Mons - Mons
Location of assessment
- Université de Mons - Mons
(*) HT : Hours of theory - HTPE : Hours of in-class exercices - HTPS : hours of practical work - HD : HMiscellaneous time - HR : Hours of remedial classes. - Per. (Period), Y=Year, Q1=1st term et Q2=2nd term