Randomness, relativization and Turing degrees
From MaRDI portal
Recommendations
Cites work
- A Theory of Program Size Formally Identical to Information Theory
- A unified approach to the definition of random sequences
- Complexity oscillations in infinite binary sequences
- Computational randomness and lowness
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- Lowness for the class of random sets
- On relative randomness
- Randomness and recursive enumerability
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- The definition of random sequences
Cited in
(70)- Constructive equivalence relations on computable probability measures
- On the uniform computational content of the Baire category theorem
- Strong reductions in effective randomness
- Coherence of reducibilities with randomness notions
- Limit complexities revisited
- On low for speed oracles
- Highness properties close to PA completeness
- Randomness and initial segment complexity for measures
- KL-randomness and effective dimension under strong reducibility
- Unified characterizations of lowness properties via Kolmogorov complexity
- Cone avoidance and randomness preservation
- Integer valued betting strategies and Turing degrees
- Trivial measures are not so trivial
- On partial randomness
- Initial segment complexities of randomness notions
- Demuth's path to randomness
- Reducibilities relating to Schnorr randomness
- Relating and contrasting plain and prefix Kolmogorov complexity
- Demuth's path to randomness
- Randomness, computation and mathematics
- Prompt enumerations and relative randomness
- Genericity and UD-random reals
- Depth, highness and DNR degrees
- Strength and weakness in computable structure theory
- Effective bi-immunity and randomness
- Jump inversions inside effectively closed sets and applications to randomness
- Difference randomness
- RELATIVIZING CHAITIN'S HALTING PROBABILITY
- Hierarchy of Computably Enumerable Degrees II
- Randomness and Computability: Open Questions
- Calibrating Randomness
- When van Lambalgen’s Theorem fails
- On initial segment complexity and degrees of randomness
- Schnorr trivial sets and truth-table reducibility
- Hyperimmune-free degrees and Schnorr triviality
- Lowness for Kurtz randomness
- Effectively approximating measurable sets by open sets
- THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
- On the interplay between effective notions of randomness and genericity
- The information content of typical reals
- Schnorr Trivial Reals: A construction
- Effective randomness for computable probability measures
- Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
- The complexity of recursive splittings of random sets
- Degrees of randomized computability
- LUZIN’S (N) AND RANDOMNESS REFLECTION
- Randomness notions and reverse mathematics
- Canonical immunity and genericity
- Relativizations of randomness and genericity notions
- Being low along a sequence and elsewhere
- Kolmogorov complexity in perspective. I: Information theory and randomness
- Continuous higher randomness
- Low for random reals and positive-measure domination
- Deep _1⁰ classes
- A random degree with strong minimal cover
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
- Continuous randomness via transformations of 2-random sequences
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- Growth and irreducibility in path-incompressible trees
- 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
- Regainingly approximable numbers and sets
- Limit complexities, minimal descriptions, and n-randomness
- Randomness and universal machines
- Schnorr trivial reals: a construction
- Lowness of higher randomness notions
- Relativized Schnorr tests with universal behavior
- The \(K\)-degrees, low for \(K\) degrees, and weakly low for \(K\) sets
This page was built for publication: Randomness, relativization and Turing degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5718673)
