15-18 Jun 2015 Heidelberg (Germany)

Program

June 15


9:00‑9:30 Welcome

09:30-10:45 Algorithmic statistics and useful information
        N. Vereshchagin, Moscow State University, Russia 

slides Vereshchagin
        
10:45‑11:15 Coffee

11:15‑12:00 Randomness as a warranty
        A. Shen, Université Montpellier 2, France

slides Shen

12:00-14:00 Lunch at IWH

14:00-14:45 Generic, coarse, co-finite and mod-finite reducibilities
        G. Igusa, University of Notre Dame, USA

slides Igusa



14:45-15:30 Exact constructive dimension
        L. Staiger, Universität Halle-Wittenberg, Germany

slides Staiger


15:30‑16:15 Coffee

16:15‑17:00 Algorithmically random functions and effective capacities
        D. Cenzer, University of Florida, USA

slides Cenzer


17:45‑19:00 Reception (drinks and snacks) at IWH


June 16


9:00‑9:30 Coffee

09:30‑10:45 Degrees and difficulty
        W. Dean, University of Warwick, UK

slides Dean

10:45‑11:15 Coffee

11:15-12:00 The randomness of empirical data, the simplicity of hypotheses,  and extreme priors
        J. Schatz, University of California Irvine, USA

slides Schatz
        

12:00‑14:00 Lunch at IWH

14:00‑15:00 Mutual information and the independence postulate
        C. Porter, University of Florida, USA

slides Porter

15:00‑15:45 Kolmogorov structure functions for automatic complexity 
        B. Kjos-Hanssen, University of Hawaii, USA

slides Kjos-Hanssen

15:45‑16:15 Coffee

16:15‑17:00
       

17:00-19:00 Time for discussion

19:00 Wine tasting at the Montpellier Haus


June 17


9:00‑9:30 Coffee

09:30‑10:45 The relevance of algebraic properties for the classification of uniform computational content
        V. Brattka, Universität der Bundeswehr München, Germany

slides Brattka

10:45‑11:15 Coffee

11:15‑12:00 The role of randomness in reverse mathematics
        L. Patey, Université Paris 7, France

slides Patey

12:00‑14:00 Lunch at IWH

Free afternoon (discussion at IWH or sightseeing)




June 18


9:00‑9:30 Coffee

09:30‑10:45 Stochasticity properties of random graphs
        J. Reimann, Penn State University, USA

slides Reimann

10:45‑11:15 Coffee

11:15‑12:00 Algorithmic randomness and constructive/computable 
mathematics
        J. Rute, Penn State University, USA

slides Rute

12:00‑14:00 Lunch at IWH

14:00‑14:45 Universality, Optimality and Randomness deficiency
        P. Shafer, Ghent University, Belgium

slide Shafer

14:45‑15:30 Effective prime uniqueness varieties of algorithmic information
        P. Cholak, University of Notre Dame, USA

slides Cholak

15:30‑16:15 Coffee

16:15‑17:30 Closing & time for discussion

Online user: 1