Turing Days'06: Randomness & Complexity*
| 09:30-09:45 |
Registration |
| 09:45-10:00 | Welcome Address: |
| 10:00-10:50 | Cristian Calude, "Incompleteness, Uncertainty and Complexity" |
| 10:50-11:00 | Coffee & Tea Break |
| 11:00-11:50 | Ray Solomonoff, "Russell and
Stochastic Complexity vs. Goedel and Algorithmic Probability. Conflict and Resolution in the History of Logic and Statistical Inference" |
| 11:50-12:00 |
Coffee & Tea Break |
| 12:00-12.50 | Alexey Chernov, "Kolmogorov
Complexity and Propositional Formulas" |
| 12:50-13:30 |
Lunch Break |
| 13:30-14:20 |
Juergen Schmidhuber,
"Generalized Turing Machines and Limit Computable Universes" |
| 14:20-14:30 |
Coffee & Tea Break |
| 14:30-15:20 |
Veronica
Becher, "The Unpublished Algorithm of Alan
Turing on Normal Numbers" |
| 15:20-16:00 |
Coffee & Tea Break |
| 16:00-16:50 |
Marcus Hutter, "The Fastest
and Shortest Algorithm for All Well-Defined Problems" pdf |
| 16:50-17:00 |
Coffee & Tea Break |
| 17:00-17:50 |
Wolfgang
Merkle, "Kolmogorov Complexity and
Computing Power" |
| 17:50-18:30 |
Wine & Cheese |