Algorithmic Randomness SCHEDULE

Sunday, June 8

NOON---: Check-In at Beaty Towers (Commons), 24 hour desk.

Monday, June 9 (Little Hall)

8--9:30 (and after): Registration (358 Little)
8--9:30: Coffee and Welcome (339 Little)
9:30--12:30: Jan Reimann, Introduction to Algorithmic Randomness, Tutorial 1 (Lecture Notes)
12:30--3: Lunch Break
3-4: Discussion (339 Little)
4:30-6:30: RECEPTION (339 Little)

Tuesday, June 10

8:30--9:30: Coffee (339 Little)
9:30--12:30: Jan Reimann, Introduction to Algorithmic Randomness, Tutorial 2
12:30--3: Lunch Break
3-4: Discussion (339 LIT)
4-4:30: Coffee (339 LIT)
4:30-5: Contributed Talk TBA

Wednesday, June 11

8:30--9:30: Coffee (339 Little)
9:30--12:30: Andre Nies, Randomness in Computability, Tutorial 1 Slides
12:30--3: Lunch Break
3-4: Discussion
4-4:30: Coffee
4:30-5: Contributed Talk TBA

Thursday, June 12

8:30--9:30: Coffee (339 Little)
9:30--12:30: Andre Nies, Randomness in Computability, Tutorial 2 Slides
12:30--3: Lunch Break
3-4: Discussion
4-4:30: Coffee
4:30-5, Joe Miller: DNC sets and Randomness

Friday, June 13

8:30--9:30: Coffee (339 Little)
9:30--12:30: Jan Reimann, Introduction to Algorithmic Randomness, Tutorial 3
12:30--3: Lunch Break
3-4: Discussion
4:30-5, Rebecca Weber: Random Closed Sets

Saturday, June 14

8:30--9:30: Coffee (339 Little)
9:30--12:30: Andre Nies, Randomness in Computability, Tutorial 3 Slides
12:30--1: Conference PhotoLunch Break
1--2, Selwyn Ng

Monday, June 16

8--9:30 (and after): Registration (358 Little)
8--9:30: Coffee (339 Little)
9:30--12:30: John Hitchcock, Algorithmic Randomness in Computational Complexity, Tutorial 1
12:30--3: Lunch Break
3-4: Discussion
4-4:30: Coffee
4:30-5: Paul Brodhead: Random Closed Sets and Continuous Functions

Tuesday, June 17

8:30--9:30: Coffee (339 Little)
9:30--12:30: John Hitchcock, Algorithmic Randomness in Computational Complexity, Tutorial 2
12:30--3: Lunch Break
3-4: Discussion
4-4:30: Coffee
4:30-5: Alex McLinden, Random Closed Sets viewed as Random Fractals

Wednesday, June 18

8:30--9:30: Coffee (339 Little)
9:30--12:30: John Hitchcock, Algorithmic Randomness in Computational Complexity, Tutorial 3
12:30--3: Lunch Break
3-4: Discussion
4-4:30: Coffee
4:30-5: Brooke Andersen, Complete sets with respect to strong notions of reducibility.
6:30-9:00: Conference Party at the Cenzers

Thursday, June 19

8:30--9:30: Coffee (339 Little)
9:30--10: Hector Zenil, Program-size complexity for short sequences
CHECK-OUT FROM BEATY BEFORE NOON.

THE END