Characterization of Kurtz randomness by a differentiation theorem
DOI10.1007/s00224-012-9422-3zbMath1283.68176OpenAlexW1989480424MaRDI QIDQ1946506
Publication date: 15 April 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9422-3
Constructive and recursive analysis (03F60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Monotonic functions, generalizations (26A48) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Functions of bounded variation, generalizations (26A45) Algorithmic randomness and dimension (03D32)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomness on computable probability spaces -- a dynamical point of view
- A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Uniform test of algorithmic randomness over a general space
- Schnorr randomness and the Lebesgue differentiation theorem
- Algorithmic Randomness and Complexity
- Differentiation Theorem for Gaussian Measures on Hilbert Space
- Algorithmic Aspects of Lipschitz Functions
- Admissible representations for probability measures
- A general form of the covering principle and relative differentiation of additive functions
This page was built for publication: Characterization of Kurtz randomness by a differentiation theorem