@Article{becher_et_al:DagRep.2.1.19,
author = {Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira},
title = {{Computability, Complexity and Randomness (Dagstuhl Seminar 12021)}},
pages = {19--38},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2012},
volume = {2},
number = {1},
editor = {Becher, Veronica and Bienvenu, Laurent and Downey, Rodney and Mayordomo, Elvira},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.1.19},
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}
}