Algorithmic Randomness Interacts with Analysis and Ergodic Theory
Videos from CMO Workshop
Jeremy Avigad, Carnegie Mellon University
Monday Dec 5, 2016 10:45 - 11:34
Computability and uniformity in ergodic theory
Ulrich Kohlenbach, Technische Universitaet Darmstadt
Monday Dec 5, 2016 11:39 - 12:25
Proof Theory of Cat(kappa) spaces
Cameron Freer, Borelian Corporation
Tuesday Dec 6, 2016 09:30 - 10:21
Unique ergodicity and measures invariant under permutations of N
Joseph S. Miller, University of Wisconsin–Madison
Tuesday Dec 6, 2016 11:00 - 11:38
Cototal enumeration degrees
Johanna Franklin, Hofstra University
Tuesday Dec 6, 2016 11:45 - 12:29
Birkhoff's ergodic theorem for measure-preserving transformations: the harder part
George Barmpalias, Chinese Academy of Sciences
Tuesday Dec 6, 2016 16:45 - 17:30
Optimal redundancy in computations from random oracles
Vasco Brattka, UniBW Munich
Wednesday Dec 7, 2016 09:30 - 10:22
Probabilistic computability and randomness in the Weihrauch lattice
Keita Yokoyama, JAIST
Wednesday Dec 7, 2016 10:45 - 11:34
Computable analysis and reverse mathematics
Jason Rute, Pennsylvania State University
Thursday Dec 8, 2016 09:30 - 10:15
Schnorr randomness for noncomputable measures
Santiago Figueira, Universidad de Buenos Aires
Thursday Dec 8, 2016 16:00 - 16:30
Normality in non-integer bases and polynomial time randomness
Cristóbal Rojas, Universidad Católica de Chile
Thursday Dec 8, 2016 16:35 - 17:09
Computability of Mandelbrot-like sets
Benoit Monin, Paris- Creteil
Friday Dec 9, 2016 10:05 - 10:42
An overview of higher randomness
Linda Brown Westrick, Victoria University of Wellington
Friday Dec 9, 2016 11:00 - 11:43
Computability and the Denjoy Hierarchy
