FRG Workshop
September 15-19, 2007

 

Organizers: Denis Hirschfeldt and Lance Fortnow

FRG Homepage

Effective Randomness Research Wiki

 

All talks will be held in Ryerson 352. (Maps: Note Ry 352 is the big room mislabeled 353 on the Ryerson map)

Links: On Campus Food, Hyde Park Food, Chicago Attractions

 

Saturday, September 15

1-2 Welcome Lunch in Ryerson 352

2-3 Stephen Simpson, Tutorial on almost everywhere domination, superhighness, and mass problems I

3:15-4:15 Bart Kastermans, Comparing Notions of Randomness

4:30-5:00 Bjorn Kjos-Hanssen, Infinite subsets of random sets

5:00-5:30 Rebecca Weber, Randomness of closed subsets of 2
w


Sunday, September 16

9:45-10:45 Eric Allender, Tutorial on derandomization techniques and Kolmogorov complexity I

11-12 Nikolai Vereshchagin, Limit complexity of finite objects and infinite sequences

12-2 Lunch on your own

2-3 Stephen Simpson, Tutorial on almost everywhere domination, superhighness, and mass problems II

3:15-4:15 Joseph Miller, Extracting information is hard

4:15-4:45 Noam Greenberg, Turing degrees of reals of positive effective packing dimension


Monday, September 17

9:45-10:45 Jan Reimann, Tutorial on randomness for continuous measures I

11-12 Theodore Slaman, NCR1 Sequences which are not 1-random relative to any continuous measure

12-12:30 Tai-Wei Hu, Uniform Distribution Representation of Martin-Löf Randomness

Afternoon Free for research and/or to explore Chicago

Tuesday, September 18

9:45-10:45 Jan Reimann, Tutorial on randomness for continuous measures II

11-12 Stephen Simpson, Recent Aspects of Mass Problems: Symbolic Dynamics and Intuitionism

12-12:30 Joseph Miller, Weak lowness notions

12:30-2 Lunch on your own

2-3 Eric Allender, Tutorial on derandomization techniques and Kolmogorov complexity II

3:15-4:15 John Hitchcock, Dimension and Learning in Computational Complexity

4:30-5:00 Chris Conidis, Effective packing dimension of
P01-classes

5:00-5:30 Elvira Mayordomo, Pushdown compression and dimension


Wednesday, September 19

9:45-10:45 Eric Allender, Tutorial on derandomization techniques and Kolmogorov complexity III

11-12 Alexander Shen, On-line probability, Randomness and Complexity

12-12:45 Antonín Kučera, Low upper bound of ideals