A Computational Approach to the Borwein-Ditor Theorem

DOI10.1007/978-3-319-40189-8_10zbMath1476.03057OpenAlexW2480870264MaRDI QIDQ3188245

Aleksander Galicki, André Nies

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40189-8_10

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32)

Related Items (1)

Lowness, Randomness, and Computable Analysis

Cites Work

• Unnamed Item
• Coherent randomness tests and computing the \(K\)-trivial sets
• Density, forcing, and the covering problem
• Schnorr randomness and the Lebesgue differentiation theorem
• Denjoy, Demuth and density
• Homotopy and the Kestelman–Borwein–Ditor Theorem
• Algorithmic Randomness and Complexity
• Lowness and nullsets
• Randomness and differentiability
• Translates of Sequences in Sets of Positive Measure
• USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
• Computability and Randomness
• The Convergent Sequences Belonging To a Set

This page was built for publication: A Computational Approach to the Borwein-Ditor Theorem