HTML Export for Dagstuhl Seminar Proceedings, Volume 6051

Copy to Clipboard Download

<h2>Dagstuhl Seminar Proceedings, Volume 6051, </h2>
<ul>
<li>
    <span class="authors">Marcus Hutter, Wolfgang Merkle, and Paul M.B. Vitanyi</span>
    <span class="title">06051 Abstracts Collection – Kolmogorov Complexity and Applications</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.1">10.4230/DagSemProc.06051.1</a>
</li>
<li>
    <span class="authors">Boris Ryabko, Jaakko Astola, and Alex Gammerman</span>
    <span class="title">Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series.</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.2">10.4230/DagSemProc.06051.2</a>
</li>
<li>
    <span class="authors">Rudi Cilibrasi and Paul M.B. Vitanyi</span>
    <span class="title">Automatic Meaning Discovery Using Google</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.3">10.4230/DagSemProc.06051.3</a>
</li>
<li>
    <span class="authors">John Tromp</span>
    <span class="title">Binary Lambda Calculus and Combinatory Logic</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.4">10.4230/DagSemProc.06051.4</a>
</li>
<li>
    <span class="authors">Alexander Shen</span>
    <span class="title">Combinatorial proof of Muchnik&#039;s theorem</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.5">10.4230/DagSemProc.06051.5</a>
</li>
<li>
    <span class="authors">Alexey Chernov, Marcus Hutter, and Jürgen Schmidhuber</span>
    <span class="title">Complexity Monotone in Conditions and Future Prediction Errors</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.6">10.4230/DagSemProc.06051.6</a>
</li>
<li>
    <span class="authors">Nick Hay</span>
    <span class="title">Error in Enumerable Sequence Prediction</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.7">10.4230/DagSemProc.06051.7</a>
</li>
<li>
    <span class="authors">Daniil Ryabko and Marcus Hutter</span>
    <span class="title">Learning in  Reactive Environments with Arbitrary Dependence</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.8">10.4230/DagSemProc.06051.8</a>
</li>
<li>
    <span class="authors">Alexander Shen</span>
    <span class="title">Multisource Algorithmic Information Theory</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.9">10.4230/DagSemProc.06051.9</a>
</li>
<li>
    <span class="authors">Christian S. Calude and Michael A. Stay</span>
    <span class="title">Natural Halting Probabilities, Partial Randomness, and Zeta Functions</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.10">10.4230/DagSemProc.06051.10</a>
</li>
<li>
    <span class="authors">Vladimir V&#039;Yugin</span>
    <span class="title">On impossibility of sequential algorithmic forecasting</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.11">10.4230/DagSemProc.06051.11</a>
</li>
<li>
    <span class="authors">Jan Poland</span>
    <span class="title">Recent Results in Universal and Non-Universal Induction</span>
    <a class="doi" href="https://doi.org/10.4230/DagSemProc.06051.12">10.4230/DagSemProc.06051.12</a>
</li>
</ul>

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail