[CLICK HERE FOR GOOGLE CALENDAR]
[CLICK HERE FOR PROGRAM IN PDF FORMAT WITH ABSTRACTS]
Tuesday, June 7, Room 0C05
9:00 - 9:30: Coffee.9:30 - 10:15: Thorsten Kräling, The partial orderings of the c.e. ibT- and cl-degrees are not elementarily equivalent
10:30 - 11:15: André Nies, Randomness meets computable analysis
11:30 - 12:15: Stijn Vermeeren, Notions of computable randomness
12:15 - 14:00: Lunch and coffee
14:00 - 14:45: Alexander Shen, Kolmogorov complexity and logical connectives
15:00 - 15:45: Fabien Givors, Sub-computabilities
15:45 - 16:15: Coffee
16:15 - 18:30: Time for discussion (in conference room or room 6C92)
18:30: Departure for restaurant.
Wednesday, June 8, Room 0C02
9:00 - 9:30: Coffee.9:30 - 10:15: Pascal Vanier, Tilings and Π 1 classes
10:30 - 11:15: Laurent Bienvenu, Randomness extraction: a computability perspective
11:30 - 12:15: Antoine Taveneaux, How much randomness is needed for statistics?
12:15 - 14:00: Lunch and coffee
14:00 - 14:45: Chris Porter, Randomness and truth-table reducibility
15:00 - 15:45: André Nies, Demuth's path to randomness
15:45 - 16:15: Coffee
16:15 - 18:30: Time for discussion (in conference room or room 6C92)