Number of the records: 1  

How much randomness is needed for statistics?

  1. 1.
    SYSNO ASEP0385834
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleHow much randomness is needed for statistics?
    Author(s) Kjos-Hanssen, B. (US)
    Taveneaux, A. (FR)
    Thapen, Neil (MU-W) RID, SAI
    Source TitleHow the World Computes. - Berlin : Springer, 2012 / Cooper S.B. ; Dawar A. ; Löwe B. - ISSN 0302-9743 - ISBN 978-3-642-30869-7
    Pagess. 395-404
    Number of pages10 s.
    Publication formPrint - P
    ActionCiE 2012. Turing Centerary Conference and Conference on Computability in Europe /8./
    Event date18.06.2012-23.06.2012
    VEvent locationCambridge
    CountryGB - United Kingdom
    Event typeWRD
    Languageeng - English
    CountryDE - Germany
    Keywordsalgorithm analysis and problem complexity ; computing ; symbolic and algebraic manipulation
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    GBP202/12/G061 GA ČR - Czech Science Foundation (CSF)
    Institutional supportMU-W - RVO:67985840
    EID SCOPUS84862198297
    DOI10.1007/978-3-642-30870-3_40
    AnnotationIn 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.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2013
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.