Every sequence is reducible to a random one
From MaRDI portal
Cited in
(52)- Dimension extractors and optimal decompression
- A topological characterization of random sequences
- Mathematical metaphysics of randomness
- Computational depth and reducibility
- Optimal redundancy in computations from random oracles
- Dimension 1 sequences are close to randoms
- Two more characterizations of \(K\)-triviality
- Bounded Turing reductions and data processing inequalities for sequences
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Randomness below complete theories of arithmetic
- Gacs-Kucera theorem
- Bi-immunity over different size alphabets
- Uniform van Lambalgen's theorem fails for computable randomness
- Initial segment complexities of randomness notions
- The Kučera-Gács theorem revisited by Levin
- Relativized depth
- Randomness, computation and mathematics
- Characterizing lowness for Demuth randomness
- Computuing K-trivial sets by incomplete random sets
- Some Questions in Computable Mathematics
- Jump inversions inside effectively closed sets and applications to randomness
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Lowness and nullsets
- Randomness and Computability: Open Questions
- Calibrating Randomness
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
- On initial segment complexity and degrees of randomness
- Recognizing strong random reals
- Characterizing strong randomness via Martin-Löf randomness
- On a theorem of gács
- Characterizing the strongly jump-traceable sets via randomness
- Computational depth and reducibility
- Solovay functions and their applications in algorithmic randomness
- Lowness for the class of random sets
- Computing from projections of random points
- Lowness for effective Hausdorff dimension
- Working with strong reducibilities above totally -c.e. and array computable degrees
- Being low along a sequence and elsewhere
- Measures and their random reals
- On the construction of effectively random sets
- Π10 classes with complex elements
- A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
- Randomness as an invariant for number representations
- Oscillation in the initial segment complexity of random reals
- Demuth randomness and computational complexity
- Convergence of random series and the rate of convergence of the strong law of large numbers in game-theoretic probability
- Martin-Löf reducibility and cost functions
- Conservation strength of the infinite pigeonhole principle for trees
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Assumptions of randomness in cosmology models
- Extending CL-reducibility on array noncomputable degrees
- Effectively closed sets of measures and randomness
This page was built for publication: Every sequence is reducible to a random one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3764139)
