An Application of Martin-Löf Randomness to Effective Probability Theory
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 260-269
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Admissible representations for probability measuresMathematical Logic Quarterly, 2007
- A computable version of the Daniell–Stone theorem on integration and linear functionalsTheoretical Computer Science, 2006
- Uniform test of algorithmic randomness over a general spaceTheoretical Computer Science, 2005
- Type‐2 computability on spaces of integrable functionsMathematical Logic Quarterly, 2004
- The Borel–Cantelli Lemmas, Probability Laws and Kolmogorov ComplexityThe Annals of Probability, 2001
- Effective properties of sets and functions in metric spaces with computability structureTheoretical Computer Science, 1999
- Lp -ComputabilityMathematical Logic Quarterly, 1999
- A computational model for metric spacesTheoretical Computer Science, 1998
- When Scott is weak on the topMathematical Structures in Computer Science, 1997
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970