A Kolmogorov complexity characterization of constructive Hausdorff dimension.
type: Item
instance of: scholarly article
title: A Kolmogorov complexity characterization of constructive Hausdorff dimension.
zbMATH Open document ID: 1045.68570
DOI: 10.1016/S0020-0190(02)00343-5
author: Elvira Mayordomo
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1856432
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: Information theory
zbMATH Keywords: Hausdorff dimension
zbMATH Keywords: Theory of computation
Wikidata QID: Q29011744
MaRDI profile type: Publication
cites work: Information, randomness and incompleteness. Papers on algorithmic information theory
cites work: Q3714302
cites work: Q4337021
cites work: Q2754206
cites work: The complexity and effectiveness of prediction algorithms
cites work: Kolmogorov complexity and Hausdorff dimension
cites work: A tight upper bound on Kolmogorov complexity and uniformly optimal prediction
full work available at URL: s0020-0190(02)00343-5
OpenAlex ID: W2076165639
description: scientific article; zbMATH DE number 1856432