Calculability, Logic and Complexity

lsinc1123  2021-2022  Charleroi

Calculability, Logic and Complexity
5.00 credits
30.0 h + 30.0 h
Q2
Teacher(s)
Deville Yves;
Language
French
Prerequisites

The prerequisite(s) for this Teaching Unit (Unité d’enseignement – UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.
Content
  • Introduction
  • Enumerable sets
  • Computability: fondamenbtal results
  • Models of computability
  • Propositional logic
  • Introduction to algorithmic complexity
  • Complexity classes
Teaching methods
This course can be given in a variety of face-to-face and distance modalities.  These may include lectures, readings, preparations, exercises, as well as individual or group work.
Evaluation methods
Different modes of evaluation can be organized: continuous assessment, graded work, participation, exam.  The exam will be written, but in case of doubt on the part of the teacher as to the grade to be given to a student, the student may be questioned orally.  Depending on the number of studentrs, the September exam can be an oral exam.
Faculty or entity
EPL


Programmes / formations proposant cette unité d'enseignement (UE)

Title of the programme
Sigle
Credits
Prerequisites
Learning outcomes
Bachelor in Computer Science