Lowness for the class of random sets

DOI10.2307/2586785MaRDI QIDQ4948515zbMATH OpenOpenAlexFDO

Authors Antonín Kučera, Sebastiaan A. Terwijn

Publication date 28 January 2001

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2586785

zbMATH Keywords

algorithmic information theoryKolmogorov-Martin-Löf randomnessrelativized randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Lowness properties and randomness
• scientific article; zbMATH DE number 1531917
• Relative randomness and cardinality
• Computational randomness and lowness

Cites work

• Every sequence is reducible to a random one
• On relative randomness
• Subsequences of normal sequences
• The definition of random sequences

Cited in

(42)

• An improved zero-one law for algorithmically random sequences
• Lowness and logical depth
• On Kurtz randomness
• Bad oracles in higher computability and randomness
• Unified characterizations of lowness properties via Kolmogorov complexity
• Nullifying randomness and genericity using symmetric difference
• Strong jump-traceability. I: The computably enumerable case
• Lowness properties and randomness
• Computational randomness and lowness
• Relative randomness for Martin-Löf random sets
• Characterizing lowness for Demuth randomness
• Computuing K-trivial sets by incomplete random sets
• Truth-table Schnorr randomness and truth-table reducible randomness
• scientific article; zbMATH DE number 4131664 (Why is no real title available?)
• Benign cost functions and lowness properties
• Cupping with random sets
• Mass Problems and Randomness
• Lowness and nullsets
• Calibrating Randomness
• Non-cupping and randomness
• scientific article; zbMATH DE number 4156423 (Why is no real title available?)
• Randomness, lowness and degrees
• On initial segment complexity and degrees of randomness
• Weak randomness, genericity and Boolean decision trees
• Lowness for Kurtz randomness
• 2009 North American Annual Meeting of the Association for Symbolic Logic
• Randomness notions and partial relativization
• scientific article; zbMATH DE number 1531917 (Why is no real title available?)
• Characterizing the strongly jump-traceable sets via randomness
• scientific article; zbMATH DE number 1929969 (Why is no real title available?)
• Trivial Reals
• The complexity of recursive splittings of random sets
• Rank and randomness
• Randomness via effective descriptive set theory
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
• Randomness, relativization and Turing degrees
• On the number of infinite sequences with trivial initial segment complexity
• Calculus of cost functions
• On relative randomness
• Tracing and domination in the Turing degrees
• Randomness and lowness notions via open covers
• Random non-cupping revisited

This page was built for publication: Lowness for the class of random sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948515)