Randomness extraction and asymptotic Hamming distance

@article{Freer2013RandomnessEA,
  title={Randomness extraction and asymptotic Hamming distance},
  author={Cameron E. Freer and Bjoern Kjos-Hanssen},
  journal={Logical Methods in Computer Science},
  year={2013},
  volume={9}
}
  • Cameron E. Freer, Bjoern Kjos-Hanssen
  • Published 2013
  • Mathematics, Computer Science
  • Logical Methods in Computer Science
  • We obtain a non-implication result in the Medvedev degrees by studying sequences that are close to Martin-L\"of random in asymptotic Hamming distance. Our result is that the class of stochastically bi-immune sets is not Medvedev reducible to the class of sets having complex packing dimension 1. 

    Topics from this paper.

    Constructing a weak subset of a random set
    Finding subsets of positive measure

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES
    A survey of Mučnik and Medvedev degrees
    20
    Diagonally non-computable functions and bi-immunity
    12
    Lowness for Kurtz randomness
    38
    Algorithmic Randomness and Complexity
    722
    Computability and randomness
    536
    Kolmogorov-Loveland randomness and stochasticity
    58
    Algorithmic randomness and complexity. Theory and Applications of Computability
    169
    The complexity of stochastic sequences
    19
    Probability: Theory and Examples
    4497
    Binary subtrees with few labeled paths
    12