pdf-format: |
|
@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 |