Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.2.1.19
URN: urn:nbn:de:0030-drops-34555
URL: https://drops.dagstuhl.de/opus/volltexte/2012/3455/
Becher, Veronica ; Bienvenu, Laurent ; Downey, Rodney ; Mayordomo, Elvira
Weitere Beteiligte (Hrsg. etc.): Veronica Becher and Laurent Bienvenu and Rodney Downey and Elvira Mayordomo
Computability, Complexity and Randomness (Dagstuhl Seminar 12021)
| pdf-format: |
|
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.
BibTeX - Entry
@Article{becher_et_al:DR:2012:3455,
author = {Veronica Becher and Laurent Bienvenu and Rodney Downey and Elvira Mayordomo},
title = {{Computability, Complexity and Randomness (Dagstuhl Seminar 12021)}},
pages = {19--38},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {2},
number = {1},
editor = {Veronica Becher and Laurent Bienvenu and Rodney Downey and Elvira Mayordomo},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3455},
URN = {urn:nbn:de:0030-drops-34555},
doi = {10.4230/DagRep.2.1.19},
annote = {Keywords: algorithmic randomness, computability theory, computationl complexity, Kolmogorov complexity, algorithmic information theory}
}
| Keywords: | algorithmic randomness, computability theory, computationl complexity, Kolmogorov complexity, algorithmic information theory | |
| Seminar: | Dagstuhl Reports, Volume 2, Issue 1 | |
| Issue date: | 2012 | |
| Date of publication: | 23.04.2012 |
