Probability Measures and Effective Randomness
From MaRDI portal
Publication:6206151
arXiv0707.1390MaRDI QIDQ6206151FDOQ6206151
Theodore A. Slaman, Jan Reimann
Publication date: 10 July 2007
Abstract: We study the question, ``For which reals does there exist a measure such that is random relative to ? We show that for every nonrecursive , there is a measure which makes random without concentrating on . We give several conditions on equivalent to there being continuous measure which makes random. We show that for all but countably many reals these conditions apply, so there is a continuous measure which makes random. There is a meta-mathematical aspect of this investigation. As one requires higher arithmetic levels in the degree of randomness, one must make use of more iterates of the power set of the continuum to show that for all but countably many 's there is a continuous which makes random to that degree.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Descriptive set theory (03E15) Applications of computability and recursion theory (03D80)
This page was built for publication: Probability Measures and Effective Randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206151)