Denjoy, Demuth and density

DOI10.1142/S0219061314500044zbMath1338.03088arXiv1308.6402MaRDI QIDQ2878781

André Nies, Rupert Hölzl, Laurent Bienvenu, Joseph S. Miller

Publication date: 5 September 2014

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.6402

zbMATH Keywords

differentiability; density; porosity; randomness; Denjoy alternative

Mathematics Subject Classification ID

03D32: Algorithmic randomness and dimension

03D78: Computation over the reals, computable analysis

Related Items

CHAITIN’S Ω AS A CONTINUOUS FUNCTION, Computing from projections of random points, USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS, Growth and irreducibility in path-incompressible trees, The random members of a \({\Pi }_{1}^{0}\) class, Algorithmic randomness and Fourier analysis, Randomness below complete theories of arithmetic, LEBESGUE DENSITY AND CLASSES, Lowness, Randomness, and Computable Analysis, A Computational Approach to the Borwein-Ditor Theorem

Cites Work

• A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
• Randomness on computable probability spaces -- a dynamical point of view
• Demuth randomness and computational complexity
• Differentiation of real functions
• A Banach-Mazur computable but not Markov computable function on the computable real numbers
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Lowness properties and randomness
• Difference randomness
• Algorithmic Randomness and Complexity
• Randomness and Computability: Open Questions
• Almost everywhere domination and superhighness
• Using random sets as oracles
• Almost everywhere domination
• Computability and Randomness
• A unified approach to the definition of random sequences
• The definition of random sequences