Annals of Pure and Applied Logic 165 (9):1470-1483 (2014)

Authors
Bjørn Kjos-Hanssen
University of Hawaii
Abstract
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure λ, a choice needs to be made. One approach is to allow randomness tests to access the measure λ as an oracle. The other approach is the opposite one, where the randomness tests are completely effective and do not have access to the information contained in λ. While the Hippocratic approach is in general much more restrictive, there are cases where the two coincide. The first author showed in 2010 that in the particular case where the notion of randomness considered is Martin-Löf randomness and the measure λ is a Bernoulli measure, classical randomness and Hippocratic randomness coincide. In this paper, we prove that this result no longer holds for other notions of randomness, namely computable randomness and stochasticity.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2014.04.014
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,252
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Computability and Randomness.Anthony Morphett - 2010 - Bulletin of Symbolic Logic 16 (1):85-87.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Higher Kurtz Randomness.Bjørn Kjos-Hanssen, André Nies, Frank Stephan & Liang Yu - 2010 - Annals of Pure and Applied Logic 161 (10):1280-1290.
Martin-Löf Randomness and Galton–Watson Processes.David Diamondstone & Bjørn Kjos-Hanssen - 2012 - Annals of Pure and Applied Logic 163 (5):519-529.
Probabilistic Algorithmic Randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Concepts of Randomness.Peter Kirschenmann - 1972 - Journal of Philosophical Logic 1 (3/4):395 - 414.
Statistics as Science: Lonergan, McShane, and Popper.Patrick H. Byrne - 2003 - Journal of Macrodynamic Analysis 3:55-75.
Lowness and $\pi _{2}^{0}$ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044 - 1052.
Lowness and Π₂⁰ Nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
Randomness, Statistics and Emergence.Garrett Barden - 1971 - Philosophical Studies (Dublin) 20:344-346.

Analytics

Added to PP index
2016-06-30

Total views
16 ( #647,595 of 2,455,762 )

Recent downloads (6 months)
1 ( #449,201 of 2,455,762 )

How can I increase my downloads?

Downloads

My notes