CONFERENCE
Computability, Randomness and Applications
June 20  24, 2016
Computability, Randomness and Applications
June 20  24, 2016
The goal of algorithmic randomness is to give a precise meaning to the notion of random individual object, using tools from computability theory. Initiated by Chaitin, Kolmogorov and Solomonoff in the 1960s, it has flourished considerably since the early 2000s. The recent advances of the field are starting to find applications in other areas of mathematics and computer science: information theory, computable analysis, proof theory and reverse mathematics, etc. The aim of this conference is to promote the various applications of algorithmic randomness and more generally of computability theory to other research areas, by bringing together researchers from these areas and computability theorists.

Scientific & Organizing Committee
Laurent Bienvenu (Université Paris Diderot) Emmanuel Jeandel (Université de Lorraine) Christopher Porter (University of Florida) Speakers
