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

• Verónica Becher (University of Buenos Aires)

Independence of normal words

• Douglas Cenzer (University of Florida)

Random numbers as probabilities of machine behaviour

• Peter Cholak (University of Notre Dame)

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

• Rod Downey (University of Wellington)

The Computational Power of Sets of Random Strings

• Willem Fouché (University of South Africa)

Zero sets  and local time of algorithmically random Brownian motion

• Johanna Franklin (Hofstra University)

Carleson’s Theorem and Schnorr randomness

• Silvère Gangloff (Aix-Marseille Université)

On the algorithmics of entropy of computable metric spaces

• Jarkko Kari (University of Turku)

On the periodicity of multidimensional words of low complexity

• Takayuki Kihara (University of California, Berkeley)

Borel isomorphism and computability

• Joseph Miller (University Wisconsin–Madison)

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

• Martin Monath (University of Heidelberg)

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

• Benoit Monin (UPEC)

A resolution of the Gamma question

• Andre Nies (University of Auckland)

Randomness connecting to set theory and to reverse mathematics

• Jake Pardo (Penn State University)

Gambling against some odds

• Andrei Romashchenko (LIRMM, Montpellier)

On centauric subshifts

• Noah Schweber (University of California, Berkeley)

Ultralimits anc computability

• Frank Stephan (National University Singapore)

On Block Pumpable Languages

• Pascal Vanier (UPEC)

Turing degree spectra of minimal subshifts

• Linda Westrick (Victoria University Wellington)

Seas of squares

• Liang Yu (Nanjing University)

On higher Friedman’s conjecture