|
|
| 9:00 |
Coffee and Registration
|
|
| 09:30 |
Rod Downey (University of Wellington, NZ):
Recent work on computability and calibrating randomness
|
|
| 10:30 |
Coffee |
|
| 11:00 |
Semen Possitselsky (Moscow, RUS):
Kolmogorov complexity, m-degrees, and bT-degrees
|
| 11:30 |
Jürgen Schmidhuber
(IDSIA, Lugano, CH):
Generalized algorithmic information, generalized algorithmic probability, and super omegas
|
| 12:00 |
Marcus Hutter (IDSIA, Lugano, CH):
On the Existence and Convergence of Computable Universal Priors
|
|
| 12:30 |
Lunch |
|
| 14:00 |
Andrej Muchnik and Alexei Semenov (Institute of New Technologies, Moscow, RUS):
A comparison of growths of simple and prefix entropies |
| 15:00 |
Alexey Chernov (Moscow State University, RUS):
Kolmogorov complexity, Kleene realizability and the weak law of excluded middle |
|
| 15:30 |
Coffee |
|
| 16:00 |
Jack Lutz (Iowa State University, Ames, USA):
Randomness and dimension
|
| 16:30 |
Elvira Mayordomo (Universidad de Zaragoza, E):
Dimensions and information measures
|
| 17:00 |
John Hitchcock (Iowa State University, Ames, USA):
Small spans in scaled dimension
|
| 17:30 |
Jan Reimann (Universität Heidelberg, D):
Dimension, capacity and perfect subsets
|
|
|
|
| 09:00 |
Eric Allender (Rutgers University, USA):
What can be efficiently reduced to the set of K-random strings?
|
| 10:00 |
Rüdiger Reischuck (Universität Lübeck, D):
The complexity of computing the Hamming
distance
|
|
| 10:30 |
Coffee |
|
| 11:00 |
Cristian S. Calude (University of Auckland, NZ) and Ludwig Staiger (Universität Halle, D):
Generalisations of disjunctive sequences
|
| 11:30 |
Veronica Becher and Santiago Figueira (Universidad de Buenos Aires, ARG):
Program
size complexity in infinite computations
|
| 12:00 |
Andrei Romashchenko (Institute of Problems of Information Transmission, Moscow, RUS):
Non-Shannon type information
inequalities and their applications
|
|
| 12:30 |
Snacks |
|
| 13:00 |
Philippe Moser (Université de Genève, CH):
A zero-one measure law for RP and
derandomization of AM if NP is not small
|
| 13:30 |
Boris Ryabko (Siberian State University, Novosibirsk, RUS):
Two-faced processes and new tests for randomness |
| 14:00 |
Andre Nies (University of Auckland, NZ):
Each low for computably random set is computable |
| 14:30 |
Wolfgang Merkle (Universität Heidelberg, D):
Kolmogorov-Loveland stochastic sequences
|
|
| 16:30 |
Guided Tour through Heidelberg |
|
| 18:30 |
Reception, Haus Buhl |
| 19:30 |
Conference Banquet, Haus Buhl |
|
Back
Home page of the Workgroup