Conference PaperPDF Available

Kolmogorov complexity, channel capacity and Hausdorff dimension

August 1989

August 1989

Conference: Fourth Joint Swedish-Soviet International Workshop on Information Theory
At: Gotland, Sweden, August 27 - September 1, 1989

Authors:

Martin Luther University Halle-Wittenberg

Content uploaded by Ludwig Staiger

Content may be subject to copyright.

FOURTH JOINT SWEDISH-SOVIET INTERNATIONAL WORKSHOP ON

INFORMATION THEORY

AUGUST 27 - SEPTEMBER 1, 1989

GOTLAND, SWEDEN

PROCEEDINGS

Organizing committee:

Thomas Ericson (Sweden)

Rolf Johannesson (Sweden)

Mark S. Pinsker (USSR)

Kamil Sh. Zigangirov (USSR)

ISBN 91-7970-725-4

Cover: Tristan Nilsson

Printed in Sweden

Studentlitteratur

Lund 1989

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Information transfer by a channel with errors from the point of view of Kolmogorov complexity

A.Yu. Rumyantsev

Conference Paper

The Kolmogorov Complexity of Real Numbers.

January 1999

Ludwig Staiger

Conference Paper

Full-text available

Kolmogorov complexity and Hausdorff dimension

August 1989

Ludwig Staiger

this paper we are mainly interestedin the first order approximation (i.e. the linear growth) of K(fi=\Delta). We considerthe functions

Conference Paper

Full-text available

Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension

August 2011

Ludwig Staiger

The present paper generalises results by Lutz and Ryabko. We prove a martingale characterisation of exact Hausdorff dimension. On this base we introduce the notion of exact constructive dimension of (sets of) infinite strings. Furthermore, we generalise Ryabko’s result on the Hausdorff dimension of the set of strings having asymptotic Kolmogorov complexity ≤ α to the case of exact dimension.

Article

The Kolmogorov Complexity of Liouville Numbers

May 1999

Ludwig Staiger

We consider for a real number a the Kolmogorov complexities of its expansions with respect to different bases. In the paper it is shown that, for usual and self-delimiting Kolmogorov complexity, the complexity of the prefixes of their expansions with respect to different bases r and b are related in a way which depends only on the relative information of one base with respect to the other. More ... [Show full abstract] precisely, we show that the complexity of the length . logr b prefix of the base r expansion of α is the same (up to an additive constant) as the logr b-fold complexity of the length l prefix of the base b expansion of α. Then we use this fact to derive complexity theoretic proofs for the base independence of the randomness of real numbers and for some properties of Liouville numbers.