FRG Workshop—Algorithmic Randomness
May 27–31, 2009
Madison, WI
André Nies' tutorials
Handouts for tutorials:
Schedule
The intention was for people to arrive on Tuesday, May 26 and leave on Sunday, May 31. All talks took place in Van Vleck B223.
The schedule is available.
Speakers
- Laurent Bienvenu, Ruprecht-Karls-Universität Heidelberg, Germany
- Solovay functions
- Doug Cenzer, University of Florida
- Random elements of random closed sets
- Chris Conidis, University of Chicago
- Effectively approximating measurable sets by open sets
- Rod Downey, Victoria University of Wellington, New Zealand
- More on dimensions
- Lance Fortnow, Northwestern University
- Avoiding computable sets in relativized polynomial-time
- Johanna Franklin, National University of Singapore
- Lowness and highness notions
- Bjørn Kjos-Hanssen, University of Hawaiʻi at Mānoa
- Members of random closed sets
- Leonid Levin, Boston University
- R. Daniel Mauldin, University of North Texas
- Random closed sets as random recursive constructions
- Alexander McLinden, University of North Texas
- Wolfgang Merkle, Ruprecht-Karls-Universität Heidelberg, Germany
- Nonmonotonic randomness notions
- André Nies, University of Auckland, New Zealand
- Cost functions
- Randomness via effective descriptive set theory
- Noopur Pathak, Pennsylvania State University
- Randomness and the Lebesgue Differentiation Theorem
- Alexander Shen, Laboratoire d'Informatique Fondamentale de Marseille
- Muchnik's game interpretation of Kolmogorov complexity
- Stephen G. Simpson, Pennsylvania State University
- Computable symbolic dynamics
- Dan Turetsky, University of Wisconsin—Madison
- Dimension level sets in the plane
Lodging
We had a block of rooms at Lowell Hall (610 Langdon Street). We made the reservations.
|