Algorithmic Randomness
February 6th, 2018 GABRIEL SENNO Quantum Information Theory
ICFO-The Institute of Photonic Sciences

Algorithmic randomness is the area of computer science that studies mathematical definitions of randomness for sequences of bits. There are many different approaches for how to formalize our intuitive idea of “random sequence“, but all of them use, in one way or another, the notion of effective procedure. In this series of theory lectures I will present the fundamental aspects of this subject starting with some basics on computability theory, then with the study of the randomness of finite strings through their Kolmogorov complexity, then extending this notion to infinite sequences, and finally reviewing some applications of the theory.

Tuesday, February 6, 2018, 10:15. Blue Lecture Room