Information vs Dimension -- an Algorithmic Perspective

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Reimann, Jan
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914907034746880
author Reimann, Jan
author_facet Reimann, Jan
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2408_05121
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Information vs Dimension -- an Algorithmic Perspective
Reimann, Jan
Logic
03D32, 68Q30
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.
title Information vs Dimension -- an Algorithmic Perspective
topic Logic
03D32, 68Q30
url https://arxiv.org/abs/2408.05121