| 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)
|
| 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)
|
