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. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 Dagstuhl Seminar Proceedings 06051- Alexander Shen: Combinatorial proof of Muchnik's theorem.
- Alexander Shen: Multisource Algorithmic Information Theory.
- John Tromp: Binary Lambda Calculus and Combinatory Logic.
- 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..
- Marcus Hutter, Wolfgang Merkle, Paul M. B. Vitányi: 06051 Abstracts Collection -- Kolmogorov Complexity and Applications.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team