Journal of Symbolic Logic

Relative Kolmogorov complexity and geometry

Stephen Binns

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

We use the notions of effective dimension and Kolmogorov complexity to describe a geometry on the set of infinite binary sequences. Geometric concepts that we define and use include angle, projections and scalar multiplication. A question related to compressibility is addressed using these ideas.

Article information

Source
J. Symbolic Logic, Volume 76, Issue 4 (2011), 1211-1239.

Dates
First available in Project Euclid: 11 October 2011

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1318338846

Digital Object Identifier
doi:10.2178/jsl/1318338846

Mathematical Reviews number (MathSciNet)
MR2895393

Zentralblatt MATH identifier
1247.03084

Citation

Binns, Stephen. Relative Kolmogorov complexity and geometry. J. Symbolic Logic 76 (2011), no. 4, 1211--1239. doi:10.2178/jsl/1318338846. https://projecteuclid.org/euclid.jsl/1318338846


Export citation

References

  • Rod Downey and Noam Greenberg, Turing degrees of reals of positive effective packing dimension, Information Processing Letters, vol. 108 (2008), pp. 198–203.
  • Rodney G Downey and Denis R Hirschfeldt, Algorithmic randomness and complexity, Springer, 2010.
  • John M. Hitchcock and Krishna B. Athreya, Effective strong dimension, algorithmic information and computational complexity, SIAM Journal on Computing, vol. 37 (2007), no. 3, pp. 671–705.
  • Jack H. Lutz, Gales and the constructive dimension of individual sequences, In Welzl et al. [27thInt?], pp. 902–913.
  • ––––, The dimensions of individual strings and sequences, Information and Computation, vol. 187(2003), pp. 49–79.
  • ––––, Effective fractal dimensions, Mathematical Logic Quarterly, vol. 51(2005), pp. 62–72.
  • Elvira Mayordomo, A Kolmogorov complexity characterization of constructive Hausdorff dimension, Information Processing Letters, vol. 84 (2002), no. 1, pp. 1–3.
  • André Nies, Computability and randomness, Oxford University Press, 2009.
  • Jan Reimann, Computability and fractal dimension, Ph.D. thesis, Ruprecht-Karls-Universität, Heidelberg, 2004.
  • E. Welzl, U. Montanari, and J. D. P. Rolim (editors), Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, 1853, Springer, 2000.