Algorithmic randomness of continuous functions
From MaRDI portal
Publication:926181
DOI10.1007/s00153-007-0060-4zbMath1141.03020OpenAlexW2160322204MaRDI QIDQ926181
George Barmpalias, Paul Brodhead, Douglas Cenzer, Rebecca Weber, Jeffery B. Remmel
Publication date: 26 May 2008
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-007-0060-4
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)
Related Items
Randomness extraction in computability theory, Sub-computable Bounded Pseudorandomness, Algorithmically Random Functions and Effective Capacities, Extraction rates of random continuous functionals, The random members of a \({\Pi }_{1}^{0}\) class
Cites Work
- Information-theoretic characterizations of recursive infinite strings
- Von Mises' definition of random sequences reconsidered
- Arithmetical representations of Brownian motion I
- Pseudojump Operators and $\Pi^0_1$ Classes
- Algorithmic Randomness of Closed Sets
- A unified approach to the definition of random sequences
- The definition of random sequences
- Logical Approaches to Computational Barriers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
