DagSemProc.06051.1.pdf
- Filesize: 171 kB
- 17 pages
Document
06051 Abstracts Collection – Kolmogorov Complexity and Applications
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6051
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-08-31
Cite AsGet BibTex
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)
https://doi.org/10.4230/DagSemProc.06051.1
https://doi.org/10.4230/DagSemProc.06051.1
Abstract
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.
Keywords
- Information theory
- Kolmogorov Complexity
- effective randomnes
- algorithmic probability
- recursion theory
- computational complexity
- machine learning knowledge discovery
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads