Concept
Axiomes de Peano
Cours associés (8)
MATH-483: Gödel and recursivity
Gödel incompleteness theorems and mathematical foundations of computer science
QUANT-400: Introduction to quantum science and technology
A broad view of the diverse aspects of the field is provided: quantum physics, communication, quantum computation, simulation of physical systems, physics of qubit platforms, hardware technologies. St
PHYS-702: Advanced Quantum Field Theory
The course builds on the course QFT1 and QFT2 and develops in parallel to the course on Gauge Theories and the SM.
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-450: Algorithms II
A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
MATH-432: Probability theory
The course is based on Durrett's text book
Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
PHYS-758: Advanced Course on Quantum Communication
The aim of this doctoral course by Nicolas Sangouard is to lay the theoretical groundwork that is needed for students to understand how to take advantage of quantum effects for communication technolog