Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

2 Algorithmic Complexity over the Reals

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.