This chapter lifts algorithmic complexity from finitary objects to infinitary ones (like points of Euclidean space) through their finitary approximations, and uses the lift to study effective fractal dimension. We show how this lift satisfies some desirable properties which imply that many distinct approaches to measuring algorithmic information content all produce the same effective dimension notion. We also include how effective fractal dimension connects to classical fractal dimension via the point-to-set principles.
Lifting Prefix Complexity to Reals: the standard lift of prefix complexity to .
Effective Hausdorff Dimension: constructive dimension and its characterizations by complexity, supergales, and tests.
Effective Dimension Variants: mutual and conditional dimension.
Point-to-Set Principles: characterizing the Hausdorff dimension and measure of a set by the effective dimensions of its points.
Robustness of the Lift: showing that the order of optimizers in the definition of conditional prefix complexity makes no difference up to sub-linear factors, and a conditional symmetry of information result.
Effective Dimension under Uniformly Continuous Maps: confirming a modulus processing inequality for conditional prefix complexity under computable, uniformly continuous maps; concluding conditional dimension is invariant under bi-computable, bi-Lipschitz continuous maps.