DagRep.2.1.19.pdf
- Filesize: 0.76 MB
- 20 pages
Document
Computability, Complexity and Randomness (Dagstuhl Seminar 12021)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 2, Issue 1
Volume: Dagstuhl Reports, Volume 2
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2012-04-23
Cite AsGet BibTex
Veronica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo. Computability, Complexity and Randomness (Dagstuhl Seminar 12021). In Dagstuhl Reports, Volume 2, Issue 1, pp. 19-38, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/DagRep.2.1.19
https://doi.org/10.4230/DagRep.2.1.19
Abstract
Research on the notions of information and randomness has drawn on methods and ideas from computability theory and cumputational complexity, as well as core mathematical subjects like measure theory and information theory. The Dagstuhl seminar 12021 ``Computability, Complexity and Randomness'' was aimed to meet people and ideas in these areas to share new results and discuss open problems.
This report collects the material presented during the course of the seminar.
Keywords
- algorithmic randomness
- computability theory
- computationl complexity
- Kolmogorov complexity
- algorithmic information theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads