A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
How Much Randomness Is Needed for Statistics?
[chapter]
2012
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-30870-3_40
fatcat:i7ezgutmsnfnpn5m2coc7owmsq