Effective Strong Dimension, Algorithmic Information, and Computational Complexity
Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, and Elvira, Mayordomo

TL;DR
This paper introduces a new gale-based characterization of packing dimension, extends it to effective strong dimensions, and explores their connections to randomness, complexity, and data compression.
Contribution
It provides the first gale characterization of packing dimension and develops effective strong dimensions linked to various computational and informational concepts.
Findings
Gale characterization of packing dimension is dual to that of Hausdorff dimension.
Effective strong dimensions relate to randomness, Kolmogorov complexity, and computational complexity.
Develops properties and applications of effective strong dimensions in complexity theory.
Abstract
The two most important notions of fractal dimension are {\it Hausdorff dimension}, developed by Hausdorff (1919), and {\it packing dimension}, developed by Tricot (1982). Lutz (2000) has recently proven a simple characterization of Hausdorff dimension in terms of {\it gales}, which are betting strategies that generalize martingales. Imposing various computability and complexity constraints on these gales produces a spectrum of effective versions of Hausdorff dimension. In this paper we show that packing dimension can also be characterized in terms of gales. Moreover, even though the usual definition of packing dimension is considerably more complex than that of Hausdorff dimension, our gale characterization of packing dimension is an exact dual of -- and every bit as simple as -- the gale characterization of Hausdorff dimension. Effectivizing our gale characterization of packing…
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 · Complexity and Algorithms in Graphs · Algorithms and Data Compression
