Physical complexity of symbolic sequences

Physica D: Nonlinear Phenomena

Volumn 137, Issue 1-2, 2000, Pages 62-69

  Adami, C ^a   Cerf, N J ^a,b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Complexity; Computation; Evolution

Indexed keywords

EID: 0347314981     PISSN: 01672789     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-2789(99)00179-7     Document Type: Article

References (24)

1. A.N. Kolmogorov, Three approaches to the definition of the concept "quantity of information", Problems Inform. Transmission 1 (1965) 1-7.
2. A.N. Kolmogorov, Combinatorial foundations of information theory and the calculus of probabilities, Russ. Math. Surv. 38 (1983) 29-40.
3. G.J. Chaitin, On the length of programs for computing finite binary sequences, J. ACM 13 (1966) 547.
4. G.J. Chaitin, A theory of program size formally equivalent to information theory, J. ACM 22 (1975) 329.
5. C.H. Bennett, Information, dissipation, and the definition of organization, in: D. Pines (Ed.), Emerging Synthesis in Science, Addison-Wesley, Reading, MA, 1987.
6. S. Lloyd, H. Pagels, Complexity as thermodynamic depth, Ann. Phys. 188 (1988) 186-213.
7. J.P. Crutchfield, K. Young, Inferring statistical complexity, Phys. Rev. Lett. 63 (1989) 105-108.
8. R. Badii, A. Politi, Complexity - Hierarchical Structures and Scaling in Physics, Cambridge University Press, Cambridge, 1997.
9. A.M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. Roy. Soc. London 42 (1936) 230.
10. G.J. Chaitin, Randomness and mathematical proof, Scientific American 232 (5) (1985) 47-52.
11. W.H. Zurek, Thermodynamic cost of computation, algorithmic complexity, and the information metric, Nature 341 (1989) 119-124.
12. W.H. Zurek, Algorithmic randomness and physical entropy, Phys. Rev. A 40 (1989) 4731-4751.
13. C. Shannon, W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, Urbana, 1949.
14. A.K. Zvonkin, L.A. Levin, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russ. Math. Surv. 256 (1970) 83-124.
15. W. Ebeling, M.A. Jimenez-Montano, On grammars, complexity and information measures of biological macromolecules, Math. Biosciences 52 (1980) 53-71.
16. A. Lempel, J. Ziv, On the complexity of finite sequences, IEEE Trans. Inform. Theory 22 (1976) 75.
17. W.H. Zurek, Algorithmic information content, Church-Turing thesis, and physical entropy, in: W. H. Zurek (Ed.), Complexity, Entropy, and the Physics of Information, Addison-Wesley, Redwood City, 1990, pp. 73-89.
18. H. Herzel, W. Ebeling, A.O. Schmitt, Entropies of biosequences: The role of repeats, Phys. Rev. E (1994) 5061-5071.
19. G.P. Basharin, On a statistical estimate for the entropy of a sequence of independent random variables, Theory Prob. Appl. 4 (1959) 333-336.
20. M. Eigen et al., How old is the genetic code? Statistical geometry of tRNA provides an answer, Science 244 (1989) 673.
21. M. Sprinzl, C. Steegborn, F. Hübel, S. Steinberg, Compilation of tRNA sequences and sequences of tRNA genes, Nucl. Acids Res. 23 (1996) 68-72.
22. G. Boyajian, T. Lutz, Evolution of biological complexity and its relation to taxonomic longevity in the Ammonoidea, Geology 20 (1992) 983-986.
23. C. Adami, Introduction to Artificial Life, TELOS, Springer, New York, 1998.
24. C.H. Bennett, Universal computation and physical dynamics, Physica D 86 (1995) 268-273.