Randomness and differentiability

DOI10.1090/tran/6484zbMath1402.03062arXiv1104.4465OpenAlexW1769462986MaRDI QIDQ3448999

Joseph S. Miller, André Nies, Vasco Brattka

Publication date: 3 November 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

differentiabilitybounded variationcomputable analysismonotonic functionalgorithmic randomness

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) 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

Demuth’s Path to Randomness, Randomness, Computation and Mathematics, A Computational Approach to the Borwein-Ditor Theorem, Randomness and Differentiability of Convex Functions, USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS, Schnorr randomness for noncomputable measures, Computing from projections of random points, Lowness, Randomness, and Computable Analysis, Algorithmic information theory and its statistical mechanical interpretation, Pointwise complexity of the derivative of a computable function, Algorithmic randomness and Fourier analysis, Algorithmic randomness, reverse mathematics, and the dominated convergence theorem, Highness properties close to PA completeness, Computable randomness and betting for computable probability spaces, Martin-Löf randomness implies multiple recurrence in effectively closed sets, Schnorr randomness and the Lebesgue differentiation theorem, Cone avoidance and randomness preservation, THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE, Continuous higher randomness, Computable Measure Theory and Algorithmic Randomness, Normality in non-integer bases and polynomial time randomness, Feasible analysis, randomness, and base invariance, Cryptography and algorithmic randomness, A Church-Turing thesis for randomness?, Closure of resource-bounded randomness notions under polynomial time permutations

Cites Work

• A simple proof of Zahorski's description of non-differentiability sets of Lipschitz functions
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Schnorr randomness and the Lebesgue differentiation theorem
• Demuth’s Path to Randomness
• Algorithmic Randomness and Complexity
• RELATIVIZING CHAITIN'S HALTING PROBABILITY
• Algorithmic Aspects of Lipschitz Functions
• Computability in Analysis and Physics
• Computability and Randomness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item