Translator Disclaimer
June 2013 Probabilistic algorithmic randomness
Sam Buss, Mia Minnes
J. Symbolic Logic 78(2): 579-601 (June 2013). DOI: 10.2178/jsl.7802130

Abstract

We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.

Citation

Download Citation

Sam Buss. Mia Minnes. "Probabilistic algorithmic randomness." J. Symbolic Logic 78 (2) 579 - 601, June 2013. https://doi.org/10.2178/jsl.7802130

Information

Published: June 2013
First available in Project Euclid: 15 May 2013

zbMATH: 1305.03037
MathSciNet: MR3145197
Digital Object Identifier: 10.2178/jsl.7802130

Rights: Copyright © 2013 Association for Symbolic Logic

JOURNAL ARTICLE
23 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.78 • No. 2 • June 2013
Back to Top