2026-07-20T05:48:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:663 2024-03-06T11:06:41Z ddc:004 open_access

06051 Abstracts Collection – Kolmogorov Complexity and Applications Hutter, Marcus Merkle, Wolfgang Vitanyi, Paul M.B. Information theory Kolmogorov Complexity effective randomnes algorithmic probability recursion theory computational complexity machine learning knowledge discovery From 29.01.06 to 03.02.06, the Dagstuhl Seminar 06051 ``Kolmogorov Complexity and Applications'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Marcus Hutter and Wolfgang Merkle and Paul M.B. Vitanyi 2006 Is Part Of Dagstuhl Seminar Proceedings, Volume 6051, Kolmogorov Complexity and Applications (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06051.1 urn:nbn:de:0030-drops-6632 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06051.1 eng https://creativecommons.org/licenses/by/4.0/legalcode