skip to main content
research-article

Mutual Dimension

Published:09 July 2015Publication History
Skip Abstract Section

Abstract

We define the lower and upper mutual dimensions mdim(x: y) and Mdim(x: y) between any two points x and y in Euclidean space. Intuitively, these are the lower and upper densities of the algorithmic information shared by x and y. We show that these quantities satisfy the main desiderata for a satisfactory measure of mutual algorithmic information. Our main theorem, the data processing inequality for mutual dimension, says that if f: Rm → Rn is computable and Lipschitz, then the inequalities mdim(f(x): y) ≤ mdim(x: y) and Mdim(f(x): y) ≤ Mdim(x: y) hold for all x ∈ Rm and y ∈ Rt. We use this inequality and related inequalities that we prove in like fashion to establish conditions under which various classes of computable functions on Euclidean space preserve or otherwise transform mutual dimensions between points.

References

  1. Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, and Elvira Mayordomo. 2007. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal of Computing 37, 3 (2007), 671--705. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. B. Bell. 1962. Mutual information and maximal correlation as measures of dependence. Annals of Mathematical Statistics 33, 2 (1962), 587--595.Google ScholarGoogle ScholarCross RefCross Ref
  3. Mark Braverman and Stephen Cook. 2006. Computing over the reals: Foundations for scientific computing. Notices of the American Mathematical Society 53, 3 (2006), 318--329.Google ScholarGoogle Scholar
  4. P. J. Couch, B. D. Daniel, and Timothy H. McNicholl. 2012. Computing space-filling curves. Theory of Computing Systems 50, 2 (2012), 370--386. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Thomas R. Cover and Joy A. Thomas. 2006. Elements of Information Theory (2nd ed.). John Wiley & Sons, Hoboken, NJ. 776 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Randall Dougherty, Jack H. Lutz, Daniel R. Mauldin, and Jason Teutsch. 2014. Translating the Cantor set by a random real. Transactions of the American Mathematical Society 366, 6 (2014), 3027--3041.Google ScholarGoogle ScholarCross RefCross Ref
  7. Kenneth Falconer. 2003. Fractal Geometry: Mathematical Foundations and Applications (2nd ed.). Wiley, Chichester, England. 366 pages.Google ScholarGoogle ScholarCross RefCross Ref
  8. Peter Gács. 1974. On the symmetry of algorithmic information. Soviet Mathematics Doklady 15, 5 (1974), 1477--1480. Correction, Ibid., 15:1480, 1974.Google ScholarGoogle Scholar
  9. Xiaoyang Gu, Jack Lutz, and Elvira Mayordomo. 2011. Curves that must be retraced. Information and Computation 209, 6 (2011), 992--1006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Xiaoyang Gu, Jack H. Lutz, and Elvira Mayordomo. 2006. Points on computable curves. In Foundations of Computer Science. IEEE Computer Society, Berkeley, CA, 469--474. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Daniel Hammer, Andrei E. Romashchenko, Alexander Shen, and Nikolai K. Vereshchagin. 2000. Inequalities for Shannon entropy and Kolmogorov complexity. Journal of Computer System Sciences 60, 2 (2000), 442--464. Google ScholarGoogle ScholarCross RefCross Ref
  12. John M. Hitchcock. 2005. Correspondence principles for effective dimensions. Theory of Computing Systems 38, 5 (2005), 559--571. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Bjørn Kjos-Hanssen and Anil Nerode. 2009. Effective dimension of points visited by Brownian motion. Theoretical Computer Science 410, 4--5 (2009), 347--354. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ker-I Ko. 1991. Complexity Theory of Real Functions. Birkhäuser, Boston, MA. 310 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Leonid A. Levin. 1973. On the notion of a random sequence. Soviet Mathematics Doklady 14, 5 (1973), 1413--1416.Google ScholarGoogle Scholar
  16. Leonid A. Levin. 1974. Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Problemy Peredachi Informatsii 10, 3 (1974), 30--35.Google ScholarGoogle Scholar
  17. Ming Li and Paul Vitányi. 2008. An Introduction to Kolmogorov Complexity and Its Applications (3rd ed.). Springer, New York, NY. 792 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Jack H. Lutz. 2003. The dimension of individual strings and sequences. Information and Computation 187, 1 (2003), 49--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Jack H. Lutz and Elvira Mayordomo. 2008. Dimensions of points in self-similar fractals. SIAM Journal on Computing 38, 3 (2008), 1080--1112. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Jack H. Lutz and Klaus Weihrauch. 2008. Connectivity properties of dimension level sets. Mathematical Logic Quarterly 54, 5 (2008), 483--491.Google ScholarGoogle ScholarCross RefCross Ref
  21. Elvira Mayordomo. 2002. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters 84, 1 (2002), 1--3. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Robert Rettinger and Xizhong Zheng. 2009. Points on computable curves of computable lengths. In MFCS. Springer, Novy Smokovec, High Tatras, Slovakia, 736--743. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Alexander Shen and Nikolai K. Vereshchagin. 2002. Logical operations and Kolmogorov complexity. Theoretical Computer Science 271, 1--2 (2002), 125--129. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Daniel Turetsky. 2011. Connectedness properties of dimension level sets. Theoretical Computer Science 412, 29 (2011), 3598--3603. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Alan M. Turing. 1937. On computable numbers, with an application to the Entscheidungsproblem. A correction. Proceedings of the London Mathematical Society 43, 2 (1937), 544--546.Google ScholarGoogle Scholar
  26. Klaus Weihrauch. 2000. Computable Analysis: An Introduction. Springer, Berlin. 285 pages. Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Mutual Dimension

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!