Skip to main content Accessibility help
×
Home

Probabilistic Algorithmic Randomness

  • Sam Buss (a1) and Mia Minnes (a1)

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.

Copyright

References

Hide All
[1] Ambos-Spies, Klaus, Algorithmic randomness revisited, Language, logic, and formalization of knowledge (McGuinness, B., editor), Bibliotheca, 1998, pp. 3352.
[2] Ambos-Spies, Klaus and Kučera, Antonín, Randomness in computability theory, Computability theory and its applications (Cholak, Peter A., Lempp, Steffen, Lerman, Manuel, and Shore, Richard A., editors), American Mathematics Society, 2000, pp. 114.
[3] Arora, Sanjeev and Barak, Boaz, Computational complexity: A modern approach, Cambridge University Press, 2009.
[4] Downey, Rodney G. and Hirschfeldt, Denis, Algorithmic randomness and complexity. Springer, 2010.
[5] Goldreich, Oded, Computational complexity: A conceptual perspective, Cambridge University Press, 2008.
[6] Hitchcock, John M. and Lutz, Jack H., Why computable complexity requires stricter martingales. Theory of Computing Systems, vol. 39 (2006), pp. 277296.
[7] Kastermans, Bart and Lempp, Steffen, Comparing notions of randomness. Theoretical Computer Science, vol. 411 (2010), no. 3, pp. 602616.
[8] Levin, Leonid, On the notion of a random sequence, Soviet Mathematics Doklady, vol. 14 (1973), pp. 14131416.
[9] Li, Ming and Vitányi, Paul, An introduction to Kolmogorov complexity and its applications, third ed., Springer, 2008.
[10] Martin-Löf, Per, The definition of random sequences, Information and Control, vol. 9 (1966), no. 6, pp. 602619.
[11] Merkle, Wolfgang, Mihailović, Nenad, and Slaman, Theodore A., Some results on effective randomness. Theory of Computing Systems, vol. 39 (2006), pp. 707721.
[12] Merkle, Wolfgang, Miller, Joseph S., Nies, André, Reimann, Jan, and Stephan, Frank, Kolmogorov–Loveland randomness and stochasticity, Annals of Pure and Applied Logic, vol. 103 (2006), pp. 183210.
[13] Muchnik, Andrei A., Semenov, Alexei L., and Uspensky, Vladimir, Mathematical metaphysics of randomness, Theoretical Computer Science, vol. 207 (1998), pp. 263317.
[14] Nies, Andre, Computability and randomness, Oxford University Press, 2009.
[15] Schnorr, Claus P., A unified approach to the definition of random sequences, Mathematical Systems Theory, vol. 5 (1971), pp. 246258.
[16] Schnorr, Claus P., Zufälligkeit und Wahrscheinlichkeit: Eine algorithmische Begründung der Wahrschein-lichkeitstheorie, Lecture Notes in Computer Science, vol. 218, Springer Verlag, 1971.
[17] Schnorr, Claus P., Process complexity and effective random tests, Journal of Computer and System Sciences, vol. 5 (1973), no. 3, pp. 378388.

Related content

Powered by UNSILO

Probabilistic Algorithmic Randomness

  • Sam Buss (a1) and Mia Minnes (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.