Programmation Avancée et Calculabilité
- Code : N8EN09B
In brief
Objectives
- Know what a calculation is, what a calculation model is, and the limits of what a computer can do (incalculability and undecidability results)
- Understand what the difficulty of a problem means.
- Compare problems in terms of computability and complexity.
- Understand and know how to use idioms and design patterns to structure an application.
Description
The course is composed of two parts. A theoretical part presents the notion of computation through several models of computation, such as Turing machines, recursive functions or quantum computing. It exposes the limits of computation through undecidability and incalculability results. This part also presents the complexity of problems in time (P, NP, NP-completeness) and space (PSPACE). The applied part presents modern approaches to programming: decorators/annotations, control inversion and dependency injection, proxies, aspect programming.
Session 1 ou session unique - Contrôle des connaissances
| Modalité | Nature | Coefficient | Remarques |
|---|---|---|---|
| CT (contrôle terminal) | Oral/Ecrit | 100% | Examen Progra° Avancées & Calculabilité |
Session 2 - Contrôle des connaissances
| Modalité | Nature | Coefficient | Remarques |
|---|---|---|---|
| CT (contrôle terminal) | Oral/Ecrit | 100% | Examen Progra° Avancées & Calculabilité |
Contact(s)
QUEINNEC PHILIPPEPlaces
- Toulouse
