2026-07-26T04:38:51Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3455 2024-03-06T10:25:47Z ddc:004 open_access

Computability, Complexity and Randomness (Dagstuhl Seminar 12021) Becher, Veronica Bienvenu, Laurent Downey, Rodney Mayordomo, Elvira algorithmic randomness computability theory computationl complexity Kolmogorov complexity algorithmic information theory 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Veronica Becher and Laurent Bienvenu and Rodney Downey and Elvira Mayordomo 2012 Is Part Of Dagstuhl Reports, Volume 2, Issue 1 (2012) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.2.1.19 urn:nbn:de:0030-drops-34555 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.1.19 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode