Algorithmic randomness over general spaces

DOI10.1002/MALQ.201200051zbMATH Open1338.03084OpenAlexW1508848603MaRDI QIDQ5419210FDOQ5419210

Authors: Kenshi Miyabe 

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

Recommendations

• Computability of probability measures and Martin-Löf randomness over metric spaces
• Martin-Löf randomness in spaces of closed sets
• Uniform test of algorithmic randomness over a general space
• Randomness -- beyond Lebesgue measure
• scientific article; zbMATH DE number 1223737

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Cites Work

• Process complexity and effective random tests
• A Theory of Program Size Formally Identical to Information Theory
• Title not available (Why is that?)
• 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
• Computability of probability measures and Martin-Löf randomness over metric spaces
• The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
• Title not available (Why is that?)
• Uniform test of algorithmic randomness over a general space
• A computable approach to measure and integration theory
• Computability on the probability measures on the Borel sets of the unit interval
• A computable version of the Daniell-Stone theorem on integration and linear functionals
• Title not available (Why is that?)
• Computable metrization
• Admissible representations for probability measures
• Random elements in effective topological spaces with measure.
• Computably regular topological spaces

Cited In (11)

• Randomness -- beyond Lebesgue measure
• Algorithmically Random Functions and Effective Capacities
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Computable Measure Theory and Algorithmic Randomness
• Effective Hausdorff dimension in general metric spaces
• An application of Martin-Löf randomness to effective probability theory
• Uniform test of algorithmic randomness over a general space
• Computable randomness and betting for computable probability spaces
• Martin-Löf randomness in spaces of closed sets
• Algorithmic randomness and monotone complexity on product space
• An optimal superfarthingale and its convergence over a computable topological space

This page was built for publication: Algorithmic randomness over general spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419210)