|
Kolmogorov centennial
celebration |
|
|
Complexity, Information, and Randomness : The Legacy of Andrei Kolmogorov In honor of the one hundreth anniversary of the birth of Andrei N. Kolmogorov, the Conference on Computational Complexity is holding a special day of talks on the topic of Kolmogorov complexity and its applications to theoretical computer science and computational complexity. Andrei Nikolaevich Kolmogorov was born on April 25, 1903 in Tambov, Russia, and died 20 Oct 1987 in Moscow, Russia. He made fundamental contributions to several areas of mathematics, including probability theory, mathematical statistics, information theory, dynamical systems, topology, logic, as well as Hilbert's 6th and 13th problems. The deep and lasting impact of his work in this area is what we celebrate in this special day in honor of the one hundredth anniversary of his birth.
PROGRAM for Sunday, July 6 200 All talks will take place in Auditorium F ,
Dept. of Mathematical Science, Ny Munkegade, bldg. 530, 1st floor 9:45 Registration and coffee
outside the auditorium 10:30 - 11:30 Alexander Shen
(IITP, Moscow) “Three Approaches to the Quantitative Definition of
Information” After (Almost) Forty Years 11:30 - 1:30 Lunch (On your
own - a list of nearby restaurants will be provided) 1:30 - 2:30 Volodya Vovk
(RHUL, London) Predictive Complexity, Information, and Randomness 2:30 - 3:30 Nikolai
Vereshchagin (Moscow State University) Kolmogorov's Structure Functions with
an Application to the Foundations of Model Selection 3:30 - 4:00 Coffee break 4:00 - 5:00 Harry Buhrman
(CWI, Amsterdam) Kolmogorov Complexity and Computational Complexity Theory 7:00 PM Welcome reception For more information contact Sophie Laplante: |
