5 credits
30.0 h + 30.0 h
Q2
Teacher(s)
Deville Yves;
Language
French
Prerequisites
Within SINF1BA : LSINF1101
Within FSA1BA : LFSAB1101, LFSAB1102, LFSAB1202, LFSAB1202, LFSAB1301, LFSAB1401
Within FSA1BA : LFSAB1101, LFSAB1102, LFSAB1202, LFSAB1202, LFSAB1301, LFSAB1401
Main themes
 Computability : problems and algorithms, computable and non computable functions, reductions, undecidable classes of problems (Rice), fix point theorem, ChurchTuring thesis
 Main computability models : Turing machines, recursive functions, lambda calculus, automates
 Complexity theory : complexity classes, NPcompleteness, Cook's theorem, how to solve NPcomplete problems
Aims
At the end of this learning unit, the student is able to :  
1  Given the learning outcomes of the "Bachelor in Engineering" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
Given the learning outcomes of the "Bachelor in Computer science" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:
Students completing successfully this course will be able to
Students will have developed skills and operational methodology. In particular, they have developed their ability to

The contribution of this Teaching Unit to the development and command of the skills and learning outcomes of the programme(s) can be accessed at the end of this sheet, in the section entitled “Programmes/courses offering this Teaching Unit”.
Content
 Introduction
 Concepts: demonstration and reasoning, sets, Cantor's diagonalization
 Computability: basic results
 Models of computability
 Analysis of the ChurchTuring thesis
 Introduction to computational complexity
 Complexity classes and NP completeness
Teaching methods
 lectures
 exercises supervised by a teaching assistant
Evaluation methods
 written exam (September, oral exam)
Other information
Background:
 SINF1121 Advanced algorithmics and data structures
Online resources
Bibliography
 Transparents en ligne
 Syllabus collaboratif
 O. Ridoux, G. Lesventes. Calculateurs, calculs, calculabilité. Dunod Collection Sciences Sup, 224 pages, 2008.
 P. Wolper Introduction à la calculabilité 2nd Edition, Dunod, 2001.
 Sipser M. Introduction to the Theory of Computation PWS Publishing Company, 1997
Teaching materials
 Transparents en ligne
 Syllabus collaboratif
Faculty or entity
INFO