Information vs Dimension -- an Algorithmic Perspective

This paper surveys work on the relation between fractal dimensions and algorithmic information theory over the past thirty years. It covers the basic development of prefix-free Kolmogorov complexity from an information theoretic point of view, before introducing Hausdorff measures and dimension along with some important examples. The main goal of the paper is to motivate and develop the informal identity “entropy = complexity = dimension” from first principles. The last section of the paper presents some new observations on multifractal measures from an algorithmic viewpoint.