Notre Dame Journal of Formal Logic

Compressibility and Kolmogorov Complexity

Stephen Binns and Marie Nicholson

Abstract

This paper continues the study of the metric topology on 2 N that was introduced by S. Binns. This topology is induced by a directional metric where the distance from Y 2 N to X 2 N is given by

lim sup n C ( X n Y n ) n .

This definition is closely related to the notions of effective Hausdorff and packing dimensions. Here we establish that this is a path-connected topology on 2 N and that under it the functions X dim H X and X dim p X are continuous.

We also investigate the scalar multiplication operation that was introduced by Binns. The multiplication of a real X 2 N by an element α [ 0 , 1 ] represents a dilution of the information in X by a factor of α .

Our main result is to show that every regular real is the dilution of a real of Hausdorff dimension 1. That is, that the information in every regular real can be maximally compressed.

Article information

Source
Notre Dame J. Formal Logic, Volume 54, Number 1 (2013), 105-123.

Dates
First available in Project Euclid: 14 December 2012

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1355494526

Digital Object Identifier
doi:10.1215/00294527-1731416

Mathematical Reviews number (MathSciNet)
MR3007965

Zentralblatt MATH identifier
1271.03058

Subjects
Primary: 03D32: Algorithmic randomness and dimension [See also 68Q30] 68Q30: Algorithmic information theory (Kolmogorov complexity, etc.) [See also 03D32]

Keywords
effective Hausdorff dimension effective packing dimension Kolmogorov complexity computability theory effective metric

Citation

Binns, Stephen; Nicholson, Marie. Compressibility and Kolmogorov Complexity. Notre Dame J. Formal Logic 54 (2013), no. 1, 105--123. doi:10.1215/00294527-1731416. https://projecteuclid.org/euclid.ndjfl/1355494526


Export citation

References

  • [1] Athreya, K., J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, “Effective strong dimension in algorithmic information and computational complexity,” SIAM Journal on Computing, vol. 37 (2007), pp. 671–705. DOI 10.1137/S0097539703446912.
  • [2] Binns, S. “Relative Kolmogorov complexity and geometry,” Journal of Symbolic Logic, vol. 76 (2011), pp. 1211–39.
  • [3] Downey, R. G., and N. Greenberg, “Turing degrees of reals of positive effective packing dimension,” Information Processing Letters, vol. 108 (2008), pp. 298–303.
  • [4] Downey, R. G., and D. R. Hirschfeldt. Algorithmic Randomness and Complexity. Springer, New York, 2010.
  • [5] Downey, R. G., D. R. Hirschfeldt, and G. LaForte “Randomness and reducibility,” Journal of Computer and System Sciences, vol. 68 (2004), pp. 96–114.
  • [6] Lutz, J. H., “Dimension in complexity classes,” pp. 158–69 in Proceeedings of the Fifteenth Annual IEEE Conference on Computational Complexity (Florence, 2000), IEEE Computer Society, Los Alamos, 2000.
  • [7] Mayordomo, E., “A Kolmogorov complexity characterization of constructive Hausdorff dimension,” Information Processing Letters, vol. 84 (2002), pp. 1–3.
  • [8] Nies, A., Computability and Randomness, vol. 51 of Oxford Logic Guides, Oxford University Press, Oxford, 2009.
  • [9] Reimann, J., Computability and Fractal dimension, Ph.D. thesis, Ruprecht-Karls-Universität, Heidelberg, 2004.
  • [10] Tricot, C., “Two definitions of fractional dimension,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 91 (1982), pp. 57–74.