Published in: OASIcs, Volume 11, 6th International Conference on Computability and Complexity in Analysis (CCA'09) (2009)
Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, and Wolfgang Merkle. Separations of Non-monotonic Randomness Notions. In 6th International Conference on Computability and Complexity in Analysis (CCA'09). Open Access Series in Informatics (OASIcs), Volume 11, pp. 71-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{bienvenu_et_al:OASIcs.CCA.2009.2260, author = {Bienvenu, Laurent and H\"{o}lzl, Rupert and Kr\"{a}ling, Thorsten and Merkle, Wolfgang}, title = {{Separations of Non-monotonic Randomness Notions}}, booktitle = {6th International Conference on Computability and Complexity in Analysis (CCA'09)}, pages = {71--82}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-12-5}, ISSN = {2190-6807}, year = {2009}, volume = {11}, editor = {Bauer, Andrej and Hertling, Peter and Ko, Ker-I}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CCA.2009.2260}, URN = {urn:nbn:de:0030-drops-22601}, doi = {10.4230/OASIcs.CCA.2009.2260}, annote = {Keywords: Martin-L\"{o}f randomness, Kolmogorov-Loveland randomness, Kolmogorov complexity, martingales, betting strategies} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, and Nikolay Veraschagin. Limit complexities revisited. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 73-84, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2008.1335, author = {Bienvenu, Laurent and Muchnik, Andrej and Shen, Alexander and Veraschagin, Nikolay}, title = {{Limit complexities revisited}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {73--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1335}, URN = {urn:nbn:de:0030-drops-13350}, doi = {10.4230/LIPIcs.STACS.2008.1335}, annote = {Keywords: Kolmogorov complexity, limit complexities, limit frequencies, 2-randomness, low basis} }
Feedback for Dagstuhl Publishing