Marcus Hutter, Wolfgang Merkle, and Paul M.B. Vitanyi. 06051 Abstracts Collection – Kolmogorov Complexity and Applications. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{hutter_et_al:DagSemProc.06051.1, author = {Hutter, Marcus and Merkle, Wolfgang and Vitanyi, Paul M.B.}, title = {{06051 Abstracts Collection – Kolmogorov Complexity and Applications}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--17}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.1}, URN = {urn:nbn:de:0030-drops-6632}, doi = {10.4230/DagSemProc.06051.1}, annote = {Keywords: Information theory, Kolmogorov Complexity, effective randomnes, algorithmic probability, recursion theory, computational complexity, machine learning knowledge discovery} }
Boris Ryabko, Jaakko Astola, and Alex Gammerman. Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ryabko_et_al:DagSemProc.06051.2, author = {Ryabko, Boris and Astola, Jaakko and Gammerman, Alex}, title = {{Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.2}, URN = {urn:nbn:de:0030-drops-6363}, doi = {10.4230/DagSemProc.06051.2}, annote = {Keywords: Algorithmic complexity, algorithmic information theory, Kolmogorov complexity, universal coding, hypothesis testing} }
Rudi Cilibrasi and Paul M.B. Vitanyi. Automatic Meaning Discovery Using Google. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{cilibrasi_et_al:DagSemProc.06051.3, author = {Cilibrasi, Rudi and Vitanyi, Paul M.B.}, title = {{Automatic Meaning Discovery Using Google}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.3}, URN = {urn:nbn:de:0030-drops-6296}, doi = {10.4230/DagSemProc.06051.3}, annote = {Keywords: Normalized Compression Distance, Clustering, Clasification, Relative Semantics of Terms, Google, World-Wide-Web, Kolmogorov complexity} }
John Tromp. Binary Lambda Calculus and Combinatory Logic. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{tromp:DagSemProc.06051.4, author = {Tromp, John}, title = {{Binary Lambda Calculus and Combinatory Logic}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.4}, URN = {urn:nbn:de:0030-drops-6289}, doi = {10.4230/DagSemProc.06051.4}, annote = {Keywords: Concrete, program size complexity, ambda calculus, combinatory logic, encoding, self-delimiting, binary strings} }
Alexander Shen. Combinatorial proof of Muchnik's theorem. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{shen:DagSemProc.06051.5, author = {Shen, Alexander}, title = {{Combinatorial proof of Muchnik's theorem}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.5}, URN = {urn:nbn:de:0030-drops-6258}, doi = {10.4230/DagSemProc.06051.5}, annote = {Keywords: Matching conditional descriptions Kolmogorov complexity} }
Alexey Chernov, Marcus Hutter, and Jürgen Schmidhuber. Complexity Monotone in Conditions and Future Prediction Errors. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{chernov_et_al:DagSemProc.06051.6, author = {Chernov, Alexey and Hutter, Marcus and Schmidhuber, J\"{u}rgen}, title = {{Complexity Monotone in Conditions and Future Prediction Errors}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.6}, URN = {urn:nbn:de:0030-drops-6327}, doi = {10.4230/DagSemProc.06051.6}, annote = {Keywords: Kolmogorov complexity, posterior bounds, online sequential prediction, Solomonoff prior, monotone conditional complexity, total error, future loss, ra} }
Nick Hay. Error in Enumerable Sequence Prediction. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{hay:DagSemProc.06051.7, author = {Hay, Nick}, title = {{Error in Enumerable Sequence Prediction}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.7}, URN = {urn:nbn:de:0030-drops-6331}, doi = {10.4230/DagSemProc.06051.7}, annote = {Keywords: Sequence prediction, Solomonoff induction, enumerable semimeasures} }
Daniil Ryabko and Marcus Hutter. Learning in Reactive Environments with Arbitrary Dependence. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ryabko_et_al:DagSemProc.06051.8, author = {Ryabko, Daniil and Hutter, Marcus}, title = {{Learning in Reactive Environments with Arbitrary Dependence}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.8}, URN = {urn:nbn:de:0030-drops-6372}, doi = {10.4230/DagSemProc.06051.8}, annote = {Keywords: Reinforcement learning, asymptotic average value, self-optimizing policies, (non) Markov decision processes} }
Alexander Shen. Multisource Algorithmic Information Theory. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{shen:DagSemProc.06051.9, author = {Shen, Alexander}, title = {{Multisource Algorithmic Information Theory}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.9}, URN = {urn:nbn:de:0030-drops-6267}, doi = {10.4230/DagSemProc.06051.9}, annote = {Keywords: Kolmogorov complexity multisource information theory} }
Christian S. Calude and Michael A. Stay. Natural Halting Probabilities, Partial Randomness, and Zeta Functions. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{calude_et_al:DagSemProc.06051.10, author = {Calude, Christian S. and Stay, Michael A.}, title = {{Natural Halting Probabilities, Partial Randomness, and Zeta Functions}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.10}, URN = {urn:nbn:de:0030-drops-6319}, doi = {10.4230/DagSemProc.06051.10}, annote = {Keywords: Natural halting probability, natural complexity} }
Vladimir V'Yugin. On impossibility of sequential algorithmic forecasting. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{vyugin:DagSemProc.06051.11, author = {V'Yugin, Vladimir}, title = {{On impossibility of sequential algorithmic forecasting}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--7}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.11}, URN = {urn:nbn:de:0030-drops-6305}, doi = {10.4230/DagSemProc.06051.11}, annote = {Keywords: Universal forecasting, computable calibration, Dawid's prequential framework, algorithmic randomness, defensive forecasting} }
Jan Poland. Recent Results in Universal and Non-Universal Induction. In Kolmogorov Complexity and Applications. Dagstuhl Seminar Proceedings, Volume 6051, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{poland:DagSemProc.06051.12, author = {Poland, Jan}, title = {{Recent Results in Universal and Non-Universal Induction}}, booktitle = {Kolmogorov Complexity and Applications}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6051}, editor = {Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.12}, URN = {urn:nbn:de:0030-drops-6355}, doi = {10.4230/DagSemProc.06051.12}, annote = {Keywords: Bayesian learning, MDL, stochastic model selection, prediction with expert advice, universal learning, Solomonoff induction} }
Feedback for Dagstuhl Publishing