Constructive Dimension and Turing Degrees
Laurent Bienvenu, David Doty, Frank Stephan

TL;DR
This paper explores how Turing degrees relate to constructive dimensions, showing that certain reductions can increase a sequence's randomness measure, with implications for the structure and limits of algorithmic randomness extraction.
Contribution
It introduces a new reduction method that acts as a randomness extractor, increasing the constructive dimension of sequences and providing new insights into Turing degrees and their dimensions.
Findings
Every sequence's dimension can be increased via a Turing reduction.
A lower bound for the dimension ratio of sequences in Turing degrees is established.
No universal extractor exists for constructive Hausdorff dimension.
Abstract
This paper examines the constructive Hausdorff and packing dimensions of Turing degrees. The main result is that every infinite sequence S with constructive Hausdorff dimension dim_H(S) and constructive packing dimension dim_P(S) is Turing equivalent to a sequence R with dim_H(R) <= (dim_H(S) / dim_P(S)) - epsilon, for arbitrary epsilon > 0. Furthermore, if dim_P(S) > 0, then dim_P(R) >= 1 - epsilon. The reduction thus serves as a *randomness extractor* that increases the algorithmic randomness of S, as measured by constructive dimension. A number of applications of this result shed new light on the constructive dimensions of Turing degrees. A lower bound of dim_H(S) / dim_P(S) is shown to hold for the Turing degree of any sequence S. A new proof is given of a previously-known zero-one law for the constructive packing dimension of Turing degrees. It is also shown that, for any regular…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Algorithms and Data Compression
