Dimension 1 sequences are close to randoms
classification
🧮 math.LO
cs.ITmath.IT
keywords
sequencedimensioneffectivecoarselyonlyrandomsimilarbits
read the original abstract
We show that a sequence has effective Hausdorff dimension 1 if and only if it is coarsely similar to a Martin-L\"{o}f random sequence. More generally, a sequence has effective dimension $s$ if and only if it is coarsely similar to a weakly $s$-random sequence. Further, for any $s<t$, every sequence of effective dimension $s$ can be changed on density at most $H^{-1}(t)-H^{-1}(s)$ of its bits to produce a sequence of effective dimension $t$, and this bound is optimal.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.