Concept
Décidabilité
Cours associés (6)
MATH-483: Gödel and recursivity
Gödel incompleteness theorems and mathematical foundations of computer science
MGT-487: Complex problem solving in organizations
As a professional you will need to solve all sorts of complex problems, requiring you to think strategically. This course develops your strategic thinking skills by giving you a three-step process and
CS-251: Theory of computation
This course constitutes an introduction to theory of computation. It discusses the basic theoretical models of computing (finite automata, Turing machine), as well as, provides a solid and mathematica
CS-550: Formal verification
We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to u
CS-451: Distributed algorithms
Computing is nowadays distributed over several machines, in a local IP-like network, a cloud or a P2P network. Failures are common and computations need to proceed despite partial failures of machin
CS-119(c): Information, Computation, Communication
L'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (