Algorithmic Randomness and Complexity, 2007. ,
DOI : 10.1007/978-0-387-68441-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.666
The miraculous universal distribution, The Mathematical Intelligencer, vol.42, issue.4, pp.7-15, 1997. ,
DOI : 10.1007/BF03024407
Universal search problems, Problems of Information Transmission, vol.9, issue.3, pp.265-266, 1973. ,
An introduction to Kolmogorov complexity and its applications, 2008. ,
The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966. ,
DOI : 10.1016/S0019-9958(66)80018-9
Computability and Randomness, 2009. ,
DOI : 10.1093/acprof:oso/9780199230761.001.0001
Zufälligkeit und Wahrscheinlichkeit Eine algorithmische Begründung der Wahrscheinlichkeitstheorie A formal theory of inductive inference : Parts 1 and 2, Information and Control, vol.7, pp.1-22, 1964. ,
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-65, 1936. ,
Randomness Through Computation, World Scientific, 2011. ,
DOI : 10.1142/7973
URL : https://hal.archives-ouvertes.fr/halshs-00792289
On the Kolmogorov-Chaitin complexity for short sequences', dans Randomness and Complexity : From Leibniz to Chaitin, edité par Cristian S. Calude, World Scientific, 2007. ,
Compression-based investigation of the dynamical properties of cellular automata and other systems, publié par le journal of Complex Systems, vol.14, issue.2, 2010. ,
URL : https://hal.archives-ouvertes.fr/halshs-00792118
Program-size versus Time Complexity, Slowdown and Speed-up phenomena in Small Turing Machines, publié dans proceedings 3rd. International workshop on Physics and Computation, 2010. ,
URL : https://hal.archives-ouvertes.fr/halshs-00792281
Complejidad descriptiva y computacional en máquinas de Turing pequeñas, Actas de las V Jornadas Ibéricas, 2010. ,
Information content characterization and classification of images by physical complexity, soumisà soumisà Complexity, 2011. ,
On the Algorithmic Nature of the World Information and ,
An example of mathematical authorship attribution, Journal of Mathematical Physics, vol.49, issue.12, pp.125211-125230, 2008. ,
DOI : 10.1063/1.2996507
The Google Similarity Distance, IEEE Transactions on Knowledge and Data Engineering, vol.19, issue.3, pp.370-383, 2007. ,
DOI : 10.1109/TKDE.2007.48
Algorithmic Clustering of Music Based on String Compression, Computer Music Journal, vol.4, issue.4, pp.49-67, 2004. ,
DOI : 10.1109/TSA.2002.800560
Transformation distances: a family of dissimilarity measures based on movements of segments, Bioinformatics, vol.15, issue.3, pp.194-202, 1999. ,
DOI : 10.1093/bioinformatics/15.3.194
The Similarity Metric, IEEE Transactions on Information Theory, vol.50, issue.12, 2003. ,
DOI : 10.1109/TIT.2004.838101
The (Mis)Behavior of Markets : A Fractal View of Risk, Ruin, and Reward, 2004. ,
Spam filtering using Kolmogorov complexity analysis, IJWGS, vol.4, issue.1, pp.136-148, 2008. ,
On Non-Computable Functions, Bell System Technical Journal, vol.41, issue.3, pp.877-884, 1962. ,
DOI : 10.1002/j.1538-7305.1962.tb00480.x
A New Kind of Science. Wolfram Media, 2002. ,
Meta-Math! The Quest for Omega, 2005. ,
Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science, An EATCS Series), 2002. ,
The miraculous universal distribution, The Mathematical Intelligencer, vol.42, issue.4, pp.7-15, 1997. ,
DOI : 10.1007/BF03024407
An Introduction to Kolmogorov Complexity and Its Applications, 1997. ,
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS, Russian Mathematical Surveys, vol.25, issue.6, pp.83-124, 1970. ,
DOI : 10.1070/RM1970v025n06ABEH001269
The Discovery of Algorithmic Probability, Journal of Computer and System Sciences, vol.55, issue.1, pp.73-88, 1997. ,
DOI : 10.1006/jcss.1997.1500
A New Kind of Science, Wolfram Media, 2002. 3. A website with the complete results of the whole experiment is available at http, p.44 ,
Computing the Busy Beaver function, Open Problems in Communication and Computation, pp.108-112, 1987. ,
Information and Randomness: An Algorithmic Perspective. (Texts in Theoretical Computer Science, An EATCS Series), 2002. ,
Most programs stop quickly or never halt, Advances in Applied Mathematics, vol.40, issue.3, pp.295-308, 2005. ,
DOI : 10.1016/j.aam.2007.01.001
URL : http://doi.org/10.1016/j.aam.2007.01.001
Computing a Glimpse of Randomness, Experimental Mathematics, vol.352, issue.1, pp.369-378, 2002. ,
DOI : 10.1080/10586458.2002.10504481
Acceleration Techniques for Busy Beaver Candidates, Proceedings of the Second Australian Undergraduate Students' Computing Conference, 2004. ,
The miraculous universal distribution, The Mathematical Intelligencer, vol.42, issue.4, pp.7-15, 1997. ,
DOI : 10.1007/BF03024407
On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, vol.22, issue.1, pp.75-81, 1976. ,
DOI : 10.1109/TIT.1976.1055501
Laws of information conservation (non-growth) and aspects of the foundation of probability theory, Problems In Form. Transmission, vol.10, pp.206-210, 1974. ,
On a Concrete Method of Assigning Complexity Measures, Doklady Akademii nauk SSSR, vol.18, issue.3, pp.727-731, 1977. ,
1973 (c) (submitted: 1972, reported in talks: 1971) English translation in: B.A.Trakhtenbrot. A Survey of Russian Approaches to Perebor (Bruteforce Search) Algorithms, Annals of the History of Computing, vol.9, issue.64, pp.265-266, 1984. ,
An Introduction to Kolmogorov Complexity and Its Applications, 2008. ,
DOI : 10.1007/978-0-387-49820-1
Computer Studies of Turing Machine Problems, Journal of the ACM, vol.12, issue.2, pp.196-212, 1965. ,
DOI : 10.1145/321264.321270
The complex behavior of simple machines, Physica D: Nonlinear Phenomena, vol.42, issue.1-3, pp.247-251, 1990. ,
DOI : 10.1016/0167-2789(90)90068-Z
On Non-Computable Functions, Bell System Technical Journal, vol.41, issue.3, pp.877-884, 1962. ,
DOI : 10.1002/j.1538-7305.1962.tb00480.x
A Preliminary Report on a General Theory of Inductive Inference, Contract AF 49(639)-376, 1960. ,
A note on the estimation of string complexity for short strings, 2009 7th International Conference on Information, Communications and Signal Processing (ICICS), 2009. ,
DOI : 10.1109/ICICS.2009.5397536
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-65, 1936. ,
A New Kind of Science. Wolfram Media, 2002. ,
ON THE ALGORITHMIC NATURE OF THE WORLD, Information and Computation. World Scientific, 2010. ,
DOI : 10.1142/9789814295482_0017
URL : https://hal.archives-ouvertes.fr/hal-00826620
Information content characterization and classification of images by physical complexity ,
from The Wolfram Demonstrations Project ,
Theory of Self-Reproducing Automata, 1966. ,
A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002. ,
DOI : 10.1115/1.1553433
Complex Chaotic Behavior of a Class of Subshift Cellular Automata, Complex Systems, vol.7, issue.4, pp.269-296, 1993. ,
Generalized sub-shifts in elementary cellular automata: the ???strange case??? of chaotic rule 180, Theoretical Computer Science, vol.201, issue.1-2, pp.171-187, 1998. ,
DOI : 10.1016/S0304-3975(97)00210-7
Time-space pattern and periodic property of elementary cellular automata ??? Sierpinski gasket and partially Sierpinski Gasket ???, Japan Journal of Industrial and Applied Mathematics, vol.10, issue.1, pp.59-73, 2001. ,
DOI : 10.1007/BF03167355
Attractors in Cellular Automata Ergodic Theory and Dynamical Systems, pp.131-140, 1990. ,
Topological and measure-theoretic properties of one-dimensional cellular automata, Physica D: Nonlinear Phenomena, vol.103, issue.1-4, pp.1-4, 1997. ,
DOI : 10.1016/S0167-2789(96)00254-0
On the classifiability of cellular automata, Theoretical Computer Science, vol.230, issue.1-2, pp.117-129, 2000. ,
DOI : 10.1016/S0304-3975(99)00042-0
Pattern growth in elementary cellular automata, Theoretical Computer Science, vol.145, issue.1-2, pp.1-26, 1995. ,
DOI : 10.1016/0304-3975(94)00155-C
Undecidability of CA Classification Schemes, Complex Systems, vol.2, issue.2, pp.177-190, 1988. ,
Cellular automata and intermediate degrees, Theoretical Computer Science, vol.296, issue.2, pp.365-375, 2003. ,
DOI : 10.1016/S0304-3975(02)00661-8
URL : http://doi.org/10.1016/s0304-3975(02)00661-8
Kolmogorov complexity and cellular automata classification, Theoretical Computer Science, vol.259, issue.1-2, pp.271-285, 2001. ,
DOI : 10.1016/S0304-3975(00)00012-8
Chaotic Properties of the Elementary Cellular Automaton Rule 40 in Wolfram's Class I, Complex Systems, vol.17, issue.3, pp.295-308, 2007. ,
Clustering by Compression, IEEE Transactions on Information Theory, vol.51, issue.4, pp.1523-1545, 2005. ,
DOI : 10.1109/TIT.2005.844059
Algorithmic Information Theory, 4th printing, 1992. ,
GZIP Documentation and Sources Available as gzip-*.tar ,
A Method for the Construction of Minimum- Redundancy Codes, Proceedings of the Institute of Radio Engineers, pp.1098-1101, 1952. ,
A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, pp.1977-337 ,
DOI : 10.1109/TIT.1977.1055714
DEFLATE Compressed Data Format Specification Version 1.3, 1996. ,
DOI : 10.17487/rfc1951
Voyageurs et baguenaudiers, Pour La Science, vol.238, pp.100-104, 1997. ,
Most programs stop quickly or never halt, Advances in Applied Mathematics, vol.40, issue.3, pp.295-308, 2008. ,
DOI : 10.1016/j.aam.2007.01.001
Logical Depth and Physical Complexity in Rolf Herken (ed) The Universal Turing Machine?a Half-Century Survey, pp.227-257, 1988. ,
How to define complexity in physics and why. In Complexity , entropy and the physics of information, SFI studies in the sciences of complexity, pp.137-148, 1990. ,
Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science. An EATCS Series, 2002. ,
Algorithmic Information Theory, IBM Journal of Research and Development, vol.21, issue.4, pp.350-359, 1977. ,
DOI : 10.1147/rd.214.0350
Shared Information and Program Plagiarism Detection IEEE Trans, 2004. ,
On the Kolmogorov-Chaitin Complexity for Short Sequences, Complexity and Randomness: From Leibniz to Chaitin, 2007. ,
DOI : 10.1142/9789812770837_0006
URL : https://hal.archives-ouvertes.fr/halshs-00792116
Influence of spatial structures on ecological applications of extremal principles Ecological Modelling, pp.531-542, 2006. ,
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: A comparison with traditional approaches, Complexity, vol.90, issue.2, 2003. ,
DOI : 10.1002/cplx.20004
Kolmogorov complexity and Information Theory Journal of Logic, Journal of Logic, Language and Information, vol.12, issue.4, pp.497-529, 2003. ,
DOI : 10.1023/A:1025011119492
A Method for the Construction of Minimum Redundancy Codes Proceedings of the IRE, pp.1098-1101, 1952. ,
Three approaches to the quantitative definition of information Problems of Information and Transmission, pp.1-7, 1965. ,
Laws of information conservation (non-growth) and aspects of the foundation of probability theory, Problems of Information Transmission, pp.206-210, 1974. ,
An Introduction to Kolmogorov Complexity and Its Applications Springer, 2008. ,
An Information-Based Sequence Distance and Its Application to Whole Mitochondrial, Genome Phylogeny Bioinformatics, vol.17, issue.2, p.149154, 2001. ,
The Similarity Metric, Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.863-872, 2003. ,
DOI : 10.1109/TIT.2004.838101
A mathematical theory of communication, Bell Systems Technical Journal, vol.27, 1948. ,
A formal theory of inductive inference: Parts 1 and 2 Information and Control, pp.1-22, 1964. ,
Operating Systems Design and Implementation, 2006. ,
A Technique for High-Performance Data Compression Computer, pp.8-19, 1984. ,
A New Kind of Science Wolfram Media, 2002. ,
ON THE ALGORITHMIC NATURE OF THE WORLD, Information and Computation, 2010. ,
DOI : 10.1142/9789814295482_0017
URL : https://hal.archives-ouvertes.fr/hal-00826620
A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol.23, issue.3, p.337343, 1977. ,
DOI : 10.1109/TIT.1977.1055714
On the Kolmogorov-Chaitin complexity for short sequences, Randomness and Complexity: from Chaitin to Leibniz, pp.343-358, 2007. ,
URL : https://hal.archives-ouvertes.fr/halshs-00792296
An introduction to Kolmogorov complexity and its applications, 1997. ,
The Encyclopedia of Integer Sequences, 1995. ,
Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science, An EATCS Series), 2002. ,
On the Kolmogorov-Chaitin complexity for short sequences Complexity and Randomness: From Leibniz to Chaitin, World Scientific, 2007. ,
The miraculous universal distribution, The Mathematical Intelligencer, vol.42, issue.4, 1997. ,
DOI : 10.1007/BF03024407
1973 (c) (submitted: 1972, reported in talks: 1971) English translation in: B.A.Trakhtenbrot. A Survey of Russian Approaches to Perebor (Brute-force Search) Algorithms, Annals of the History of Computing, vol.9, issue.64, pp.265-266384, 1984. ,
An Introduction to Kolmogorov Complexity and Its Applications, 2008. ,
Algebraic properties of DNA operations, Biosystems, vol.52, issue.1-3, 1999. ,
DOI : 10.1016/S0303-2647(99)00032-5
Programming the Universe: A Quantum Computer Scientist Takes On the Cosmos, 2006. ,
Algorithmic Theories of Everything, arXiv:quant-ph, 2000. ,
Statistical Methods, Iowa State University Press, 1989. ,
Probability Theory: The Logic of Science, 2003. ,
DOI : 10.1017/CBO9780511790423
A New Kind of Science, Wolfram Media, 2002. ,
Théorie de la spéculation Annales Scientifiques de l'Ecole Normale Supérieure, pp.21-86, 1900. ,
Information and Randomness: An Algorithmic Perspective (Texts in Theoretical Computer Science. An EATCS Series), 2002. ,
Advances in Behavioral Economics ,
Exploring Randomness, 2001. ,
DOI : 10.1007/978-1-4471-0307-3
Economics as an Inductive Science, Southern Economic Journal, vol.60, issue.4, pp.805-819, 1994. ,
DOI : 10.2307/1060421
Financial modeling with Jump Processes, 2003. ,
On the Kolmogorov-Chaitin complexity for short sequences Complexity and Randomness: From Leibniz to Chaitin, 2007. ,
Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness, Applied Mathematics and Computation, vol.219, issue.1, 2011. ,
DOI : 10.1016/j.amc.2011.10.006
URL : https://hal.archives-ouvertes.fr/hal-00825530
Mandelbrot and the Stable Paretian Hypothesis, The Journal of Business, vol.36, issue.4, pp.420-462, 1963. ,
DOI : 10.1086/294633
The Behavior of Stock-Market Prices, The Journal of Business, vol.38, issue.1, pp.34-105, 1965. ,
DOI : 10.1086/294743
) Permutation, Parametric and Bootstrap Tests of Hypotheses, 2005. ,
On universal prediction and Bayesian confirmation, Theoretical Computer Science, vol.384, issue.1, pp.1-33, 2007. ,
DOI : 10.1016/j.tcs.2007.05.016
Probability Theory: The Logic of Science, 2003. ,
DOI : 10.1017/CBO9780511790423
General Theory of Employment Interest and Money, 1936. ,
The miraculous universal distribution, The Mathematical Intelligencer, vol.42, issue.4, 1997. ,
DOI : 10.1007/BF03024407
Predictability of Large Future Changes in a Competitive Evolving Population, Physical Review Letters, vol.88, issue.1, p.11, 2002. ,
DOI : 10.1103/PhysRevLett.88.017902
On a concrete method of Assigning Complexity Measures, Doklady Akademii nauk SSSR, vol.18, issue.3, pp.727-731, 1977. ,
Universal Search Problems (submitted: 1972, reported in talks: 1971) English translation in: B.A.Trakhtenbrot. A Survey of Russian Approaches to Perebor (Brute-force Search) Algorithms, Annals of the History of Computing, vol.9, issue.64, pp.265-266384, 1973. ,
An Introduction to Kolmogorov Complexity and Its Applications, p.3, 1997. ,
A random walk down Wall Street : the time-tested strategy for successful investing, 2003. ,
The Variation of Certain Speculative Prices, The Journal of Business, vol.36, issue.4, pp.394-419, 1963. ,
DOI : 10.1086/294632
Algorithmic complexity of real financial markets, Physica A: Statistical Mechanics and its Applications, vol.301, issue.1-4, pp.483-492, 2001. ,
DOI : 10.1016/S0378-4371(01)00434-4
The definition of random sequences, Information and Control, vol.9, issue.6, pp.602-619, 1966. ,
DOI : 10.1016/S0019-9958(66)80018-9
The meaning of the concept of probability in application to finite sequences, 1990. ,
Probability and confirmation. Mathematics, Matter and Methods: Philosophical papers I, 1975. ,
Foundations of Economic Analysis, 1947. ,
A formal theory of inductive inference. Part I, Information and Control, vol.7, issue.1, pp.1-22, 1964. ,
DOI : 10.1016/S0019-9958(64)90223-2
Computable Economics, 2000. ,
DOI : 10.1093/0198295278.001.0001
A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002. ,
DOI : 10.1115/1.1553433
On the algorithmic nature of the world. Forthcoming in Dodig-Crnkovic, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00826620
Program size Versus Time Complexity: Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines, 2010. ,
How to define complexity in physics and why, in Complexity , entropy and the physics of information, SFI studies in the sciences of complexity, pp.137-148, 1990. ,
Universality in Elementary Cellular Automata, Complex Systems, 2004. ,
The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971. ,
DOI : 10.1145/800157.805047
G??del's theorem and information, International Journal of Theoretical Physics, vol.89, issue.5, pp.941-954, 1982. ,
DOI : 10.1007/BF02084159
Most programs stop quickly or never halt, Advances in Applied Mathematics, vol.40, issue.3, pp.295-308, 2005. ,
DOI : 10.1016/j.aam.2007.01.001
Turing Machine Enumeration: NKS versus Lexicographical, 2010. ,
Turing machine runtimes per number of states, 2011. ,
Universal search problems, Problems of Information Transmission, vol.9, issue.3, pp.265-266, 1973. ,
Computer Studies of Turing Machine Problems, Journal of the ACM, vol.12, issue.2, pp.196-212, 1965. ,
DOI : 10.1145/321264.321270
Programming the Universe; Random House, 2006. ,
A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, p.3, 2002. ,
DOI : 10.1115/1.1553433
On the time complexity of 2-tag systems and small universal turing machines, In FOCS, pp.439-448, 2006. ,
Small Semi-weakly Universal Turing Machines, Fundamenta Informaticae, vol.91, pp.161-177, 2009. ,
DOI : 10.1007/978-3-540-74593-8_26
A general class of sieve generated sequences, Acta Arithmetica, vol.16, pp.41-56, 1969. ,
Empirical Encounters with Computational Irreducibility and Unpredictability, Minds and Machines, vol.296, issue.3, 2010. ,
DOI : 10.1007/s11023-011-9262-y