4th Conference on Logic Computability and Randomness
June 29 - July 3, 2009
Marseille, France
logo

Conference program

Abstracts

pdf file

Sunday June 28, 2009

14:00-19:00 Arrival and registration

Monday June 29, 2009

07:00-09:00 Breakfast
09:00-12:30 Arrival and registration. Time for discussion.
12:30-14:15 Lunch
14:15-14:30 Welcome address [pdf]
14:30-15:15 Serge Grigorieff: Effective Wadge hard sets [pdf]
15:15-16:00 Joe Miller: Gaps for 2-random reals [pdf]
16:00-16:30 Coffee break
16:30-17:15 Adam Day : Increasing the gap between descriptional complexity and algorithmic probability [pdf]
17:15-18:00 Bruno Bauwens : Ideal hypothesis testing and algorithmic information transfer [pdf]
18:00-18:45 Selwyn Ng : Degrees of reals with positive effective packing dimension [pdf]
18:45-21:00 Time for discussion + dinner (served at 19:30)

Tuesday June 30, 2009

07:00-09:00 Breakfast
09:00-09:45 Eric Allender: Circuits, Levin's Kt complexity, and some new unconditional lower bounds
09:45-10:30 Cristobal Rojas: Randomness on computable probability spaces: a dynamical point of view [pdf]
10:30-11:00 Coffee break
11:00-11:45 Mathieu Hoyrup: Layerwise computablity [pdf]
11:45-12:30 George Barmpalias: Degrees of unsolvability and degrees of compressibility [pdf]
12:30-14:30 Lunch
14:30-15:15 Paul Vitanyi : Positive and negative randomness [ppt]
15:15-16:00 Nikolay Vereshchagin : On algorithmic sufficient statistics
16:00-16:30 Coffee break
16:30-17:15 Andrey Rumyantsev : Forbidden strings and sequences [pdf]
17:15-18:00 Pavel Karpovich : Monotone complexity of a pair [pdf]
18:00-18:45 Alexander Shen : Unpublished work of An.A. Muchnik
18:45-21:00 Time for discussion + dinner (served at 19:30)

Wednesday July 1, 2009

07:00-09:00 Breakfast
09:00-09:45 Andre Nies : New directions in computability and randomness [pdf]
09:45-10:30 Hayato Takahashi: Algorithmic randomness and monotone complexity on product spaces [pdf]
10:30-11:00 Coffee break
11:00-11:45 Cristian Calude: Every c.e. random real is provable c.e. random [pdf]
11:45-12:30 Bjorn Kjos-Hanssen: Feeble subsets [pdf]
12:30-14:30 Lunch
14:30-19:30 Excursion in the calanques
19:30-21:00 Dinner

Thursday July 2, 2009

07:00-09:00 Breakfast
09:00-09:45 Noam Greenberg: Yet more on strongly jump-traceable sets [pdf]
09:45-10:30 Johanna Franklin: Far from weak randomness [pdf]
10:30-11:00 Coffee break
11:00-11:45 Elvira Mayordomo: Resource-bounded dimension in computational learning theory [ppt]
11:45-12:30 Ludwig Staiger: On domains of universal machines [pdf]
12:30-14:30 Lunch
14:30-15:15 Liang Yu : The theory of higher randomness [pdf]
15:15-16:00 Kohtaro Tadaki : A statictical mechanical interpretation of algorithmic information theory [pdf]
16:00-16:30 Coffee break
16:30-17:15 Alexey Chernov : Practical aspects of Levin's neutral measure [pdf]
17:15-18:00 Vladimir Vyugin : Coding-invariant classification of infinite sequences [pdf]
18:00-21:00 Time for discussion + dinner (served at 19:30)

Friday July 3, 2009

07:00-09:00 Breakfast
09:00-09:45 Douglas Cenzer: Random elements of random closed sets [pdf]
09:45-10:30 Wolfgang Merkle: Non-monotonic randomness notions [pdf]
10:30-11:00 Coffee break
11:00-11:45 Jack Lutz: Dimension spectra of random fractals
11:45-12:30 End of the conference. Time for discussions
12:30-14:30 Lunch
14:30-19:30 Free afternoon. Time for discussions
19:30-21:00 Dinner
Webmaster / Last modified April 24th, 2009 / [html] [css]