Published in: Dagstuhl Reports, Volume 4, Issue 11 (2015)
Wolfgang Banzhaf, Christoph Flamm, Daniel Merkle, and Peter F. Stadler. Algorithmic Cheminformatics (Dagstuhl Seminar 14452). In Dagstuhl Reports, Volume 4, Issue 11, pp. 22-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{banzhaf_et_al:DagRep.4.11.22, author = {Banzhaf, Wolfgang and Flamm, Christoph and Merkle, Daniel and Stadler, Peter F.}, title = {{Algorithmic Cheminformatics (Dagstuhl Seminar 14452)}}, pages = {22--39}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {4}, number = {11}, editor = {Banzhaf, Wolfgang and Flamm, Christoph and Merkle, Daniel and Stadler, Peter F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.11.22}, URN = {urn:nbn:de:0030-drops-49686}, doi = {10.4230/DagRep.4.11.22}, annote = {Keywords: Graph Transformation Systems, Graph and Hypergraph Invariants, Graph Comparison, Network Flows, Hypergraphs, Formal Languages, Algebraic Chemistry} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Wolfgang Merkle and Jason Teutsch. Constant compression and random weights. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 172-181, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{merkle_et_al:LIPIcs.STACS.2012.172, author = {Merkle, Wolfgang and Teutsch, Jason}, title = {{Constant compression and random weights}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {172--181}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.172}, URN = {urn:nbn:de:0030-drops-34351}, doi = {10.4230/LIPIcs.STACS.2012.172}, annote = {Keywords: computational complexity, Kolmogorov complexity, algorithmic randomness, Omega number} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Laurent Bienvenu, Wolfgang Merkle, and Andre Nies. Solovay functions and K-triviality. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 452-463, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2011.452, author = {Bienvenu, Laurent and Merkle, Wolfgang and Nies, Andre}, title = {{Solovay functions and K-triviality}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {452--463}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.452}, URN = {urn:nbn:de:0030-drops-30345}, doi = {10.4230/LIPIcs.STACS.2011.452}, annote = {Keywords: Algorithmic randomness, Kolmogorov complexity, K-triviality} }
Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, and Wolfgang Merkle. Separations of Non-monotonic Randomness Notions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 71-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bienvenu_et_al:OASIcs.CCA.2009.2260, author = {Bienvenu, Laurent and H\"{o}lzl, Rupert and Kr\"{a}ling, Thorsten and Merkle, Wolfgang}, title = {{Separations of Non-monotonic Randomness Notions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {71--82}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2260}, URN = {urn:nbn:de:0030-drops-22601}, doi = {10.4230/OASIcs.CCA.2009.2260}, annote = {Keywords: Martin-L\"{o}f randomness, Kolmogorov-Loveland randomness, Kolmogorov complexity, martingales, betting strategies} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006)
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-dev.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} }
Feedback for Dagstuhl Publishing