Randomness and Computability: Open Questions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1688364 (Why is no real title available?)
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 2216397 (Why is no real title available?)
- A Kolmogorov complexity characterization of constructive Hausdorff dimension.
- Algorithmic randomness and complexity.
- An almost deep degree
- Computational randomness and lowness
- Constructive dimension equals Kolmogorov complexity
- Every 2-random real is Kolmogorov random
- Every sequence is reducible to a random one
- Kolmogorov-Loveland randomness and stochasticity
- Lowness and nullsets
- Lowness properties and randomness
- Mathematical metaphysics of randomness
- On relative randomness
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Randomness and reducibility
- Randomness, relativization and Turing degrees
- The axiomatization of randomness
Cited in
(47)- A random set which only computes strongly jump-traceable c.e. sets
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees
- scientific article; zbMATH DE number 3930980 (Why is no real title available?)
- Randomness and universal machines
- Jump inversions inside effectively closed sets and applications to randomness
- Lowness for Demuth Randomness
- Some Questions in Computable Mathematics
- 𝐾-trivial degrees and the jump-traceability hierarchy
- Comparing notions of randomness
- Extracting Kolmogorov complexity with applications to dimension zero-one laws
- On randomness, determinism and computability
- K-triviality in computable metric spaces
- COMPLEXITY, INFORMATION, ENERGY
- Random non-cupping revisited
- Characterizing strong randomness via Martin-Löf randomness
- THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
- Low upper bounds of ideals
- Randomness, computation and mathematics
- Strong jump-traceability. I: The computably enumerable case
- Randomness notions and reverse mathematics
- Computability, algorithmic randomness and complexity
- Dimension extractors and optimal decompression
- Benign cost functions and lowness properties
- Asymptotic density, immunity and randomness
- Inherent enumerability of strong jump-traceability
- Hyperimmune-free degrees and Schnorr triviality
- Calibrating Randomness
- Effective packing dimension of $\Pi ^0_1$-classes
- Lowness, Randomness, and Computable Analysis
- scientific article; zbMATH DE number 6019540 (Why is no real title available?)
- Turing degrees of reals of positive effective packing dimension
- Optimal redundancy in computations from random oracles
- A universal pair of 1/2-betting strategies
- Using almost-everywhere theorems from analysis to study randomness
- Upper bounds on ideals in the computably enumerable Turing degrees
- Tracing and domination in the Turing degrees
- Strong jump-traceability
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Differences of halting probabilities
- Cupping with random sets
- Denjoy, Demuth and density
- Non-cupping and randomness
- Strong jump-traceability. II: K-triviality
- Characterizing the strongly jump-traceable sets via randomness
- Difference randomness
- Demuth randomness and computational complexity
This page was built for publication: Randomness and Computability: Open Questions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412462)
