How much randomness is needed for statistics?

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00385834" target="_blank" >RIV/67985840:_____/12:00385834 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-30870-3_40" target="_blank" >http://dx.doi.org/10.1007/978-3-642-30870-3_40</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-30870-3_40" target="_blank" >10.1007/978-3-642-30870-3_40</a>

Result language
angličtina
Original language name
How much randomness is needed for statistics?
Original language description
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 ?classicalapproach). 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 morerestrictive, 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.
Czech name
—
Czech description
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)