Lowness, Randomness, and Computable Analysis
From MaRDI portal
Publication:2970988
DOI10.1007/978-3-319-50062-1_42zbMath1485.03166arXiv1607.07030OpenAlexW2512262326MaRDI QIDQ2970988
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.07030
Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coherent randomness tests and computing the \(K\)-trivial sets
- On degrees of recursive unsolvability
- Information-theoretic characterizations of recursive infinite strings
- Ergodic theorems for individual random sequences
- Density, forcing, and the covering problem
- The recursively enumerable degrees are dense
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Lowness properties and randomness
- Computational randomness and lowness
- Randomness, Computability, and Density
- DEMUTH’S PATH TO RANDOMNESS
- Asymptotic density and the coarse computability bound
- LEBESGUE DENSITY AND CLASSES
- Schnorr randomness and the Lebesgue differentiation theorem
- Denjoy, Demuth and density
- COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
- Differentiability of polynomial time computable functions
- COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
- An Analogy between Cardinal Characteristics and Highness Properties of Oracles
- A Refinement of Lown and Highn for the R.E. Degrees
- A computational aspect of the Lebesgue differentiation theorem
- Algorithmic Randomness and Complexity
- Asymptotic density, computable traceability, and 1-randomness
- A Computational Approach to the Borwein-Ditor Theorem
- A minimal degree less than 0’
- Lowness and nullsets
- Randomness and Computability: Open Questions
- Randomness and differentiability
- Indifferent Sets
- T-Degrees, Jump Classes, and Strong Reducibilities
- A Unifying Approach to the Gamma Question
- Algorithmic Aspects of Lipschitz Functions
- Using random sets as oracles
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS
- The degrees of bi‐immune sets
- Semirecursive Sets and Positive Reducibility
- The Degrees of Hyperimmune Sets
- ∏ 0 1 Classes and Degrees of Theories
