How much randomness is needed for statistics?

In S. Barry Cooper (ed.), How the World Computes. pp. 395--404 (2012)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,517

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

How much randomness is needed for statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen - 2014 - Annals of Pure and Applied Logic 165 (9):1470-1483.
Algorithmic randomness over general spaces.Kenshi Miyabe - 2014 - Mathematical Logic Quarterly 60 (3):184-204.
Randomness and Semimeasures.Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter & Paul Shafer - 2017 - Notre Dame Journal of Formal Logic 58 (3):301-328.
Mathematical foundations of randomness.Abhijit Dasgupta - 2011 - In Prasanta S. Bandyopadhyay & Malcolm Forster (eds.), Handbook of the Philosophy of Science, Vol. 7: Philosophy of Statistics. Elsevier B.V.. pp. 641-710.
Bernoulli randomness and Bernoulli normality.Andrew DeLapo - 2021 - Mathematical Logic Quarterly 67 (3):359-373.
Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.

Analytics

Added to PP
2014-01-28

Downloads
29 (#548,815)

6 months
15 (#236,788)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Bjørn Kjos-Hanssen
University of Hawaii

References found in this work

Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.

Add more references