How much randomness is needed for statistics?

dc.contributor.author Kjos-Hanssen, Bjoern
dc.date.accessioned 2012-11-05T22:54:12Z
dc.date.available 2012-11-05T22:54:12Z
dc.date.issued 2012-11-05
dc.description.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 (which we call the \classical approach"). The other approach is the opposite one, where the randomness tests are completely effective and do not have access to the information contained in λ (we call this approach \Hippocratic"). 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.
dc.format.extent 17
dc.identifier.uri http://hdl.handle.net/10125/24285
dc.subject Hippocratic randomness
dc.subject martingales
dc.subject Bernoulli measures
dc.title How much randomness is needed for statistics?
dc.type Article
dc.type.dcmi Text
dc.version Peer Reviewed Preprint
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
randomness_apal[1].pdf
Size:
345.08 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description: