On effectively closed sets of effective strong measure zero
From MaRDI portal
Publication:2453070
Recommendations
Cites work
- \(K\)-trivials are never continuously random
- Algorithmic randomness and complexity.
- Anti-complex sets and reducibilities with tiny use
- Computability and randomness
- Concentrated and rarified sets of points
- Effective strong nullness and effectively closed sets
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension
- Finding paths through narrow and wide trees
- scientific article; zbMATH DE number 3427324 (Why is no real title available?)
- scientific article; zbMATH DE number 4051595 (Why is no real title available?)
- scientific article; zbMATH DE number 4068853 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 3489016 (Why is no real title available?)
- scientific article; zbMATH DE number 1226899 (Why is no real title available?)
- scientific article; zbMATH DE number 1543075 (Why is no real title available?)
- scientific article; zbMATH DE number 3402606 (Why is no real title available?)
- scientific article; zbMATH DE number 2216397 (Why is no real title available?)
- Hyperimmunity in \(2^{\mathbb N}\)
- Immunity and non-cupping for closed sets
- Kolmogorov complexity of initial segments of sequences and arithmetical definability
- Located sets and reverse mathematics
- Mass Problems and Randomness
- Mass problems associated with effectively closed sets
- On Schnorr and computable randomness, martingales, and machines
- On the consistency of Borel's conjecture
- Propagation of partial randomness
- Schnorr trivial sets and truth-table reducibility
- Schnorr triviality and genericity
- Small \(\Pi^{0}_{1}\) classes
- Strong reductions in effective randomness
- The Structure of the Real Line
- Traceable Sets
- Unified characterizations of lowness properties via Kolmogorov complexity
- Von Mises' definition of random sequences reconsidered
- Π10 classes with complex elements
Cited in
(7)- Unified characterizations of lowness properties via Kolmogorov complexity
- Effective strong nullness and effectively closed sets
- Higher randomness and forcing with closed sets
- Effectively approximating measurable sets by open sets
- Effectively closed subgroups of the infinite symmetric group
- Randomness for computable measures and initial segment complexity
- On the computability of perfect subsets of sets with positive measure
This page was built for publication: On effectively closed sets of effective strong measure zero
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453070)