Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 7208216, 10 pages
https://doi.org/10.1155/2017/7208216
Research Article

A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences

1Grupo de Lógica, Lenguaje e Información, Universidad de Sevilla, Sevilla, Spain
2Algorithmic Nature Group, LABORES, Paris, France
3Algorithmic Dynamics Lab, Center for Molecular Medicine, Science for Life Laboratory (SciLifeLab), Department of Medicine, Solna, Karolinska Institute, Stockholm, Sweden
4Group of Structural Biology, Department of Computer Science, University of Oxford, Oxford, UK

Correspondence should be addressed to Hector Zenil; moc.liamg@clinezh

Received 19 February 2017; Revised 22 June 2017; Accepted 7 August 2017; Published 21 December 2017

Academic Editor: Giacomo Innocenti

Copyright © 2017 Fernando Soler-Toscano and Hector Zenil. 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. A. N. Kolmogorov, “Three approaches to the quantitative definition of information,” International Journal of Computer Mathematics, vol. 2, no. 1-4, pp. 157–168, 1968. View at Publisher · View at Google Scholar · View at Scopus
  2. G. J. Chaitin, “On the length of programs for computing finite binary sequences: statistical considerations,” Journal of the ACM, vol. 16, pp. 145–159, 1969. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. L. A. Levin, “Laws on the conservation (zero increase) of information, and questions on the foundations of probability theory,” Akademiya Nauk SSSR. Institut Problem Peredachi Informatsii Akademii Nauk SSSR. Problemy Peredachi Informatsii, vol. 10, no. 3, pp. 30–35, 1974. View at Google Scholar · View at MathSciNet
  4. J.-P. Delahaye and H. Zenil, “Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness,” Applied Mathematics and Computation, vol. 219, no. 1, pp. 63–77, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. F. Soler-Toscano, H. Zenil, J.-P. Delahaye, and N. Gauvrit, “Calculating Kolmogorov complexity from the output frequency distributions of small turing machines,” PLoS ONE, vol. 9, no. 5, Article ID e96223, 2014. View at Publisher · View at Google Scholar · View at Scopus
  6. R. J. Solomonoff, “A formal theory of inductive inference. Part II,” Information and Control, vol. 7, no. 2, pp. 224–254, 1964. View at Publisher · View at Google Scholar · View at Scopus
  7. W. Kirchherr, M. Li, and P. Vitányi, “The miraculous universal distribution,” The Mathematical Intelligencer, vol. 19, no. 4, pp. 7–15, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  8. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, New York, NY, USA, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  9. N. Gauvrit, H. Zenil, F. Soler-Toscano, J. Delahaye, P. Brugger, and F. C. Santos, “Human behavioral complexity peaks at age 25,” PLoS Computational Biology, vol. 13, no. 4, p. e1005408, 2017. View at Publisher · View at Google Scholar
  10. N. Gauvrit, H. Zenil, J.-P. Delahaye, and F. Soler-Toscano, “Algorithmic complexity for short binary strings applied to psychology: A primer,” Behavior Research Methods, vol. 46, no. 3, pp. 732–744, 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. N. Gauvrit, H. Singmann, F. Soler-Toscano, and H. Zenil, “Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method,” Behavior Research Methods, vol. 48, no. 1, pp. 314–329, 2016. View at Publisher · View at Google Scholar · View at Scopus
  12. N. Gauvrit, F. Soler-Toscano, and H. Zenil, “Natural scene statistics mediate the perception of image complexity,” Visual Cognition, vol. 22, no. 8, pp. 1084–1091, 2014. View at Publisher · View at Google Scholar · View at Scopus
  13. V. Kempe, N. Gauvrit, and D. Forsyth, “Structure emerges faster during cultural transmission in children than in adults,” Cognition, vol. 136, pp. 247–254, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Zenil and J.-P. Delahaye, “An algorithmic information theoretic approach to the behaviour of financial markets,” Journal of Economic Surveys, vol. 25, no. 3, pp. 431–463, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Zenil, F. Soler-Toscano, K. Dingle, and A. A. Louis, “Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks,” Physica A: Statistical Mechanics and its Applications, vol. 404, pp. 341–358, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. H. Zenil, N. A. Kiani, and J. Tegnér, “Methods of information theory and algorithmic complexity for network biology,” Seminars in Cell & Developmental Biology, vol. 51, pp. 32–43, 2016. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Zenil, N. A. Kiani, and J. Tegnér, “Low-algorithmic-complexity entropy-deceiving graphs,” Physical Review E: Statistical, Nonlinear, and Soft Matter Physics, vol. 96, no. 1, 2017. View at Publisher · View at Google Scholar
  18. T. Radó, “On non-computable functions,” Bell Labs Technical Journal, vol. 41, pp. 877–884, 1962. View at Publisher · View at Google Scholar · View at MathSciNet
  19. J.-P. Delahaye and H. Zenil, Towards a stable definition of Kolmogorov-Chaitin complexity, arXiv, 0804.3459, 2007, arXiv:0804.3459.
  20. A. H. Brady, “The determination of the value of Rado's noncomputable function Σ(k) for four-state Turing machines,” Mathematics of Computation, vol. 40, no. 162, pp. 647–665, 1983. View at Publisher · View at Google Scholar · View at MathSciNet
  21. F. Soler-Toscano, H. Zenil, J.-P. Delahaye, and N. Gauvrit, “Correspondence and independence of numerical evaluations of algorithmic information measures,” Computability. The Journal of the Association CiE, vol. 2, no. 2, pp. 125–140, 2013. View at Google Scholar · View at MathSciNet
  22. H. Zenil and J.-P. Delahaye, “On the algorithmic nature of the world,” in Information and Computation, vol. 2 of World Sci. Ser. Inf. Stud., pp. 477–496, World Sci. Publ., Hackensack, NJ, 2011. View at Google Scholar · View at MathSciNet
  23. 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
  24. H. Zenil, F. Soler-Toscano, N. A. Kiani, S. Hernßndez-Orozco, A. Rueda-Toicen, and S. Hernández-Orozco, “A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity,” https://arxiv.org/abs/1609.00110.