Algorithmic randomness over general spaces
From MaRDI portal
Publication:5419210
DOI10.1002/malq.201200051zbMath1338.03084OpenAlexW1508848603MaRDI QIDQ5419210
Publication date: 6 June 2014
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201200051
Related Items (max. 100)
Effective Hausdorff dimension in general metric spaces ⋮ Computable randomness and betting for computable probability spaces ⋮ Computable Measure Theory and Algorithmic Randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computable approach to measure and integration theory
- Computability on the probability measures on the Borel sets of the unit interval
- Random elements in effective topological spaces with measure.
- Process complexity and effective random tests
- Computability of probability measures and Martin-Löf randomness over metric spaces
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- Uniform test of algorithmic randomness over a general space
- Computably regular topological spaces
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
- A Theory of Program Size Formally Identical to Information Theory
- Computable metrization
- Admissible representations for probability measures
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
This page was built for publication: Algorithmic randomness over general spaces
