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)


Independence of normal words

Random numbers as probabilities of machine behaviour

Density-1-bounding and quasiminimality in the generic and coarse degrees

The Computational Power of Sets of Random Strings

Zero sets  and local time of algorithmically random Brownian motion

Carleson’s Theorem and Schnorr randomness

On the algorithmics of entropy of computable metric spaces

On the periodicity of multidimensional words of low complexity

Borel isomorphism and computability

A derivation on the field of d.c.e.reals

On totally omega-c.e. degrees and complex left-c.e.reals

A resolution of the Gamma question

Randomness connecting to set theory and to reverse mathematics

Gambling against some odds

On centauric subshifts

Ultralimits anc computability

On Block Pumpable Languages

Turing degree spectra of minimal subshifts

Seas of squares

On higher Friedman’s conjecture