Dagstuhl Seminar Proceedings:
Kolmogorov Complexity and Applications 2006
Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi (Eds.):
Kolmogorov Complexity and Applications, 29.01. - 03.02.2006.
Dagstuhl Seminar Proceedings 06051 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- Alexander Shen:
Combinatorial proof of Muchnik's theorem.
- Alexander Shen:
Multisource Algorithmic Information Theory.
- John Tromp:
Binary Lambda Calculus and Combinatory Logic.
- Rudi Cilibrasi, Paul M. B. Vitányi:
Automatic Meaning Discovery Using Google.
- Vladimir V. V'yugin:
On impossibility of sequential algorithmic forecasting.
- Cristian S. Calude, Michael A. Stay:
Natural Halting Probabilities, Partial Randomness, and Zeta Functions.
- Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
Complexity Monotone in Conditions and Future Prediction Errors.
- Nick Hay:
Error in Enumerable Sequence Prediction.
- Jan Poland:
Recent Results in Universal and Non-Universal Induction.
- Boris Ryabko, Jaakko Astola, Alexander Gammerman:
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series..
- Daniil Ryabko, Marcus Hutter:
Learning in Reactive Environments with Arbitrary Dependence.
- Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi:
06051 Abstracts Collection -- Kolmogorov Complexity and Applications.
Copyright © Mon Mar 15 03:28:29 2010
by Michael Ley (ley@uni-trier.de)