Table of Contents Author Guidelines Submit a Manuscript
Advances in Mathematical Physics
Volume 2016 (2016), Article ID 5030593, 21 pages
http://dx.doi.org/10.1155/2016/5030593
Research Article

Fractal Dimension versus Process Complexity

1Departamento de Lògica, Història i Filosofia de la Ciéncia, Universitat de Barcelona, 08001 Barcelona, Spain
2Algorithmic Nature Group, LABORES, 75006 Paris, France
3Departamento de Filosofía, Lógica y Filosofía de la Ciencia, Universidad de Sevilla, 41018 Seville, Spain
4Unit of Computational Medicine, SciLifeLab, Department of Medicine Solna, Center for Molecular Medicine, Karolinska Institute, 171 76 Stockholm, Sweden
5Department of Computer Science, University of Oxford, Oxford OX1 3QD, UK

Received 1 May 2016; Accepted 29 June 2016

Academic Editor: Joao Florindo

Copyright © 2016 Joost J. Joosten et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. Zenil, “Compression-based investigation of the dynamical properties of cellular automata and other systems,” Complex Systems, vol. 19, no. 1, pp. 1–28, 2010. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. H. Zenil and E. Villarreal, “Asymptotic behaviour and ratios of complexity in cellular automata rule spaces,” International Journal of Bifurcation and Chaos, vol. 23, no. 9, pp. 13–19, 2013. View at Google Scholar
  3. R. J. Solomonoff, “A formal theory of inductive inference. II,” Information and Computation, vol. 7, pp. 224–254, 1964. View at Google Scholar · View at MathSciNet
  4. A. K. Zvonkin and L. A. Levin, “The complexity of finite objects and the basing of the concepts of information and randomness on the theory of algorithms,” Russian Mathematical Surveys, vol. 25, no. 6, pp. 85–127, 1970. View at Google Scholar · View at MathSciNet
  5. C. H. Bennett, “Logical depth and physical complexity,” in The Universal Turing Machine: A Half-Century Survey, pp. 227–257, Oxford University Press, 1988. View at Google Scholar · View at MathSciNet
  6. H. Zenil, F. Soler-Toscano, J. Delahaye, and N. Gauvrit, “Two-dimensional Kolmogorov complexity and an empirical validation of the coding theorem method by compressibility,” PeerJ Computer Science, vol. 1, article e23, 2015. View at Publisher · View at Google Scholar
  7. G. J. Chaitin, “Computing the busy beaver function,” in Open Problems in Communication and Computation, T. M. Cover and B. Gopinath, Eds., pp. 108–112, Springer, New York, NY, USA, 1987. View at Publisher · View at Google Scholar
  8. H. Zenil, “On the dynamic qualitative behaviour of universal computation,” Complex Systems, vol. 20, no. 3, pp. 265–277, 2012. View at Google Scholar
  9. S. Krakover, “Spatio-temporal structure of population growth in urban regions: the cases of Tel-Aviv and Haifa, Israel,” Urban Studies, vol. 22, no. 4, pp. 317–328, 1985. View at Publisher · View at Google Scholar · View at Scopus
  10. T. Vicsek, Fractal Growth Phenomena, World Scientific, Singapore, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J. Feng and Y. G. Chen, “Spatiotemporal evolution of urban form and land-use structure in Hangzhou, China: evidence from fractals,” Environment and Planning B: Planning and Design, vol. 37, no. 5, pp. 838–856, 2010. View at Publisher · View at Google Scholar · View at Scopus
  12. S. Wolfram, A New Kind of Science, Wolfram Media, 2002. View at MathSciNet
  13. J. J. Joosten, “Turing machine enumeration: NKS versus lexicographical,” Wolfram Demonstrations Project, 2010.
  14. J. J. Joosten, F. Soler-Toscano, and H. Zenil, “Program-size versus time complexity slowdown and speed-up phenomena in the micro-cosmos of small turing machines,” International Journal of Unconventional Computing, vol. 7, no. 5, pp. 353–387, 2011. View at Google Scholar · View at Scopus
  15. T. Neary and D. Woods, “Small fast universal Turing machines,” Theoretical Computer Science, vol. 362, no. 1–3, pp. 171–195, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. M. Margenstern, “Frontier between decidability and undecidability: a survey,” Theoretical Computer Science, vol. 231, no. 2, pp. 217–251, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  17. F. Hausdorff, “Dimension und äusseres mass,” Mathematische Annalen, vol. 79, pp. 157–179, 1919. View at Google Scholar
  18. K. Tadaki, “The Hausdorff dimension of the halting self-similar sets of T-universal prefix-free machines,” in Proceedings of the 2010 IEEE International Symposium on Information Theory (ISIT '10), pp. 1287–1291, IEEE, Austin, Tex, USA, June 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. H. Zenil, F. Soler-Toscano, and J. J. Joosten, “Empirical encounters with computational irreducibility and unpredictability,” Minds and Machines, vol. 22, no. 3, pp. 149–165, 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. J. J. Joosten, F. Soler-Toscano, and H. Zenil, Fractal Dimension versus Time Complexity in Turing Machines, Wolfram Demonstrations Project, 2014.
  21. T. Rado, “On non-computable functions,” The Bell System Technical Journal, vol. 41, no. 3, pp. 877–884, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  22. J. J. Joosten, “On the necessity of complexity,” in Irreducibility and Computational Equivalence: 10 Years After the Publication of Wolfram's A New Kind of Science, H. Zenil, Ed., pp. 11–24, Springer, New York, NY, USA, 2013. View at Google Scholar
  23. J. J. Joosten, “Complexity fits the fittest,” in How Nature Works, I. Zelinka, A. Sanayei, H. Zenil, and O. E. Rössler, Eds., vol. 5 of Emergence, Complexity and Computation, pp. 51–63, Springer, Berlin, Germany, 2014. View at Publisher · View at Google Scholar
  24. G. A. Edgar, Measure, Topology, and Fractal Geometry, Springer, New York, NY, USA, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  25. K. J. Falconer, Fractal Geometry, Mathematical Foundations and Applications, John Wiley & Sons, Chichester, UK, 2003.
  26. C. Carathéodory, “Über das lineare mass von punktmengen, eine veralgemeinerung des längenbegriffs,” Nachrichten von der Wissenschaften zu Götingen, Mathematisch-Physikalische Klass, pp. 404–426, 1914. View at Google Scholar
  27. A. S. Besicovitch, “On linear sets of points of fractional dimension,” Mathematische Annalen, vol. 101, no. 1, pp. 161–193, 1929. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. A. S. Besicovitch, “On the sum of digits of real numbers represented in the dyadic system. On sets of fractional dimensions II,” Mathematische Annalen, vol. 110, no. 1, pp. 321–330, 1935. View at Publisher · View at Google Scholar · View at Scopus
  29. A. S. Besicovitch, “Sets of fractional dimensions. Part III,” London Mathematical Society, vol. s2–47, pp. 436–454, 1942. View at Google Scholar
  30. A. S. Besicovitch, “Sets of fractional dimensions (IV): on rational approximation to real numbers,” Journal of the London Mathematical Society, vol. s1–9, no. 2, pp. 126–131, 1934. View at Publisher · View at Google Scholar
  31. A. S. Besicovitch and H. D. Ursell, “Sets of fractional dimensions (V): on dimensional numbers of some continuous curves,” Journal of the London Mathematical Society, vol. s1–s12, no. 1, pp. 18–25, 1937. View at Publisher · View at Google Scholar
  32. C. Tricot Jr., “Two definitions of fractional dimension,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 91, no. 1, pp. 57–74, 1982. View at Publisher · View at Google Scholar · View at MathSciNet
  33. D. Sullivan, “Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups,” Acta Mathematica, vol. 153, no. 3-4, pp. 259–277, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  34. S. J. Taylor, “The measure theory of random fractals,” Mathematical Proceedings of the Cambridge Philosophical Society, vol. 100, no. 3, pp. 383–406, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  35. L. Staiger, “A tight upper bound on Kolmogorov complexity and uniformly optimal prediction,” Theory of Computing Systems, vol. 31, no. 3, pp. 215–229, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  36. L. Staiger, “Constructive dimension equals Kolmogorov complexity,” Information Processing Letters, vol. 93, no. 3, pp. 149–153, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  37. C. T. Chong, “Complex dynamics and turing degrees,” 2009.
  38. J. Milnor, Dynamics in One Complex Variable. Introductory Lectures, Princeton University Press, Princeton, NJ, USA, 2006.
  39. M. Braverman and M. Yampolsky, Computability of Julia sets, vol. 23 of Algorithms and Computation in Mathematics, Springer, Berline, Germany, 2009. View at MathSciNet
  40. S. Banach and S. Mazur, “Sur les fonctions calculables,” Annales Polonici Mathematici, vol. 16, p. 223, 1937. View at Google Scholar
  41. A. A. Markov, “On constructive mathematics,” Akademiya Nauk SSSR. Trudy Matematicheskogo Instituta imeni V. A. Steklova, vol. 67, pp. 8–14, 1962. View at Google Scholar · View at MathSciNet
  42. K. Weihrauch, Computable Analysis, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  43. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer, New York, NY, USA, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  44. R. G. Downey and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Theory and Applications of Computability, Springer, New York, NY, USA, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  45. J. H. Lutz, “The dimensions of individual strings and sequences,” Information and Computation, vol. 187, no. 1, pp. 49–79, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. J. M. Hitchcock, “Correspondence principles for effective dimensions,” Theory of Computing Systems, vol. 38, no. 5, pp. 559–571, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. S. A. Terwijn, “Complexity and randomness,” Rendiconti del Seminario Matematico di Torino, vol. 62, pp. 57–74, 2004. View at Google Scholar
  48. J. Jockusch, M. Lerman, R. I. Soare, and R. M. Solovay, “Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion,” The Journal of Symbolic Logic, vol. 54, no. 4, pp. 1288–1323, 1989. View at Publisher · View at Google Scholar · View at MathSciNet
  49. J. S. Miller, “Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension,” Advances in Mathematics, vol. 226, no. 1, pp. 373–384, 2011. View at Publisher · View at Google Scholar · View at Scopus
  50. M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer, New York, NY, USA, 3rd edition, 2008. View at Publisher · View at Google Scholar
  51. E. Mayordomo, “A Kolmogorov complexity characterization of constructive Hausdorff dimension,” Information Processing Letters, vol. 84, no. 1, pp. 1–3, 2002. View at Publisher · View at Google Scholar · View at Scopus
  52. J. H. Lutz, “Gales and the constructive dimension of individual sequences,” in Automata, Languages and Programming: 27th International Colloquium, ICALP 2000 Geneva, Switzerland, July 9–15, 2000 Proceedings, vol. 1853 of Lecture Notes in Computer Science, pp. 902–913, Springer, Berlin, Germany, 2000. View at Publisher · View at Google Scholar
  53. P. Lévy, Théorie de l'Addition des Variables Aléatoires, Gauthier-Villars, Paris, France, 1937.
  54. J. Reimann, Computability and fractal dimension [Ph.D. thesis], Universitä Heidelberg, 2004.