Characterization of Kurtz randomness by a differentiation theorem

DOI10.1007/S00224-012-9422-3MaRDI QIDQ1946506zbMATH OpenOpenAlexFDO

Authors Kenshi Miyabe

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

zbMATH Keywords

differentiabilityintegral testcomputable metric spaceKurtz randomnessthe differentiation theorem

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Functions of bounded variation, generalizations (26A45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Monotonic functions, generalizations (26A48) Constructive and recursive analysis (03F60)

Recommendations

• On Kurtz randomness
• Randomness and differentiability
• Uniform Kurtz randomness
• Higher Kurtz randomness
• Schnorr randomness and the Lebesgue differentiation theorem

Cites work

• scientific article; zbMATH DE number 5309069 (Why is no real title available?)
• scientific article; zbMATH DE number 3508473 (Why is no real title available?)
• scientific article; zbMATH DE number 472936 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
• A general form of the covering principle and relative differentiation of additive functions
• A tutorial on computable analysis
• Admissible representations for probability measures
• Algorithmic aspects of Lipschitz functions
• Algorithmic randomness and complexity.
• Computability and randomness
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Differentiation Theorem for Gaussian Measures on Hilbert Space
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Elementary computable topology
• Randomness on computable probability spaces -- a dynamical point of view
• Schnorr randomness and the Lebesgue differentiation theorem
• Uniform test of algorithmic randomness over a general space

Cited in

(5)

• Pointwise complexity of the derivative of a computable function
• Using almost-everywhere theorems from analysis to study randomness
• Randomness and differentiability
• Schnorr randomness and the Lebesgue differentiation theorem
• On analogues of the Church-Turing thesis in algorithmic randomness

This page was built for publication: Characterization of Kurtz randomness by a differentiation theorem

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