On effectively closed sets of effective strong measure zero
From MaRDI portal
Publication:2453070
DOI10.1016/j.apal.2014.04.013zbMath1351.03033MaRDI QIDQ2453070
Takayuki Kihara, Kojiro Higuchi
Publication date: 6 June 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2014.04.013
Kolmogorov complexity; martingale; algorithmic probability; strong measure zero; computable traceability; Muchnik degree
03E15: Descriptive set theory
03D80: Applications of computability and recursion theory
03D30: Other degrees and reducibilities in computability and recursion theory
03D32: Algorithmic randomness and dimension
Related Items
Effectively closed subgroups of the infinite symmetric group, Randomness for computable measures and initial segment complexity, Unified characterizations of lowness properties via Kolmogorov complexity
Cites Work
- Propagation of partial randomness
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Mass problems associated with effectively closed sets
- Immunity and non-cupping for closed sets
- On the consistency of Borel's conjecture
- Strong reductions in effective randomness
- Concentrated and rarified sets of points
- Unified characterizations of lowness properties via Kolmogorov complexity
- Hyperimmunity in \(2^{\mathbb N}\)
- Small \(\Pi^{0}_{1}\) classes
- Effective Strong Nullness and Effectively Closed Sets
- Kolmogorov complexity and the Recursion Theorem
- On Schnorr and computable randomness, martingales, and machines
- Algorithmic Randomness and Complexity
- The Structure of the Real Line
- Traceable Sets
- Mass Problems and Randomness
- Schnorr trivial sets and truth-table reducibility
- Finding paths through narrow and wide trees
- Von Mises' definition of random sequences reconsidered
- Located sets and reverse mathematics
- K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM
- Schnorr triviality and genericity
- Anti-Complex Sets and Reducibilities with Tiny Use
- Π10 classes with complex elements
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
