Lowness and nullsets

DOI10.2178/JSL/1154698590MaRDI QIDQ3410688zbMATH OpenOpenAlexFDO

Authors André Nies, Rebecca Weber, Liang Yu, Rodney G. Downey

Publication date 29 November 2006

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

Full work available at URL https://doi.org/10.2178/jsl/1154698590

zbMATH Keywords

2-randomnesslowness

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Lowness notions, measure and domination
• On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets
• Lowness properties of reals and hyper-immunity
• scientific article; zbMATH DE number 7731221
• Bounded-low sets and the high/low hierarchy
• Low separation axioms via \(\tilde{g}D\)-sets
• A classification of low c.e. sets and the Ershov hierarchy
• Low sets without subsets of higher many-one degree
• A uniform version of non-\(\mathrm{low}_{2}\)-ness
• Low dimensional sections of basic semialgebraic sets

Cites work

• Algorithmic randomness and complexity.
• Degrees of Unsolvability. (AM-55)
• Every sequence is reducible to a random one
• Lowness for the class of random sets
• On Kurtz randomness
• The definition of random sequences

Cited in

(25)

• Unified characterizations of lowness properties via Kolmogorov complexity
• Trivial measures are not so trivial
• Strong jump-traceability. I: The computably enumerable case
• Initial segment complexities of randomness notions
• Defining a randomness notion via another
• Lowness, Randomness, and Computable Analysis
• Difference randomness
• Low sets without subsets of higher many-one degree
• A computational approach to the Borwein-Ditor theorem
• Randomness and Computability: Open Questions
• Recognizing strong random reals
• Characterizing strong randomness via Martin-Löf randomness
• Higher randomness and genericity
• WEAKLY 2-RANDOMS AND 1-GENERICS IN SCOTT SETS
• Relationships between computability-theoretic properties of problems
• scientific article; zbMATH DE number 7204368 (Why is no real title available?)
• Taking the path computably traveled
• Low-complexity Haar null sets without $G_\delta $ hulls in $\mathbb {Z}^\omega $
• Using almost-everywhere theorems from analysis to study randomness
• Density-1-bounding and quasiminimality in the generic degrees
• A Weakly 2-Random Set That Is Not Generalized Low
• Effective randomness for continuous measures
• Theory and Applications of Models of Computation
• Continuous randomness via transformations of 2-random sequences
• Randomness and lowness notions via open covers

This page was built for publication: Lowness and nullsets

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