10.1016/s0167-2789(99)00179-7
Crossref journal-article
Elsevier BV
Physica D: Nonlinear Phenomena (78)
Bibliography

Adami, C., & Cerf, N. J. (2000). Physical complexity of symbolic sequences. Physica D: Nonlinear Phenomena, 137(1–2), 62–69.

Authors 2
  1. C. Adami (first)
  2. N.J. Cerf (additional)
References 24 Referenced 96
  1. {'key': '10.1016/S0167-2789(99)00179-7_BIB1', 'first-page': '1', 'article-title': 'Three approaches to the definition of the concept “quantity of information”', 'volume': '1', 'author': 'Kolmogorov', 'year': '1965', 'journal-title': 'Problems Inform. Transmission'} / Problems Inform. Transmission / Three approaches to the definition of the concept “quantity of information” by Kolmogorov (1965)
  2. 10.1070/RM1983v038n04ABEH004203 / Russ. Math. Surv. / Combinatorial foundations of information theory and the calculus of probabilities by Kolmogorov (1983)
  3. 10.1145/321356.321363 / J. ACM / On the length of programs for computing finite binary sequences by Chaitin (1966)
  4. 10.1145/321892.321894 / J. ACM / A theory of program size formally equivalent to information theory by Chaitin (1975)
  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. 10.1016/0003-4916(88)90094-2 / Ann. Phys. / Complexity as thermodynamic depth by Lloyd (1988)
  7. 10.1103/PhysRevLett.63.105 / Phys. Rev. Lett. / Inferring statistical complexity by Crutchfield (1989)
  8. R. Badii, A. Politi, Complexity—Hierarchical Structures and Scaling in Physics, Cambridge University Press, Cambridge, 1997. (10.1017/CBO9780511524691)
  9. {'key': '10.1016/S0167-2789(99)00179-7_BIB9', 'first-page': '230', 'article-title': 'On computable numbers, with an application to the Entscheidungsproblem', 'volume': '42', 'author': 'Turing', 'year': '1936', 'journal-title': 'Proc. Roy. Soc. London'} / Proc. Roy. Soc. London / On computable numbers, with an application to the Entscheidungsproblem by Turing (1936)
  10. 10.1038/scientificamerican0575-47 / Scientific American / Randomness and mathematical proof by Chaitin (1985)
  11. 10.1038/341119a0 / Nature / Thermodynamic cost of computation, algorithmic complexity, and the information metric by Zurek (1989)
  12. 10.1103/PhysRevA.40.4731 / Phys. Rev. A / Algorithmic randomness and physical entropy by Zurek (1989)
  13. C. Shannon, W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, Urbana, 1949.
  14. 10.1070/RM1970v025n06ABEH001269 / Russ. Math. Surv. / The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms by Zvonkin (1970)
  15. 10.1016/0025-5564(80)90004-8 / Math. Biosciences / On grammars, complexity and information measures of biological macromolecules by Ebeling (1980)
  16. 10.1109/TIT.1976.1055501 / IEEE Trans. Inform. Theory / On the complexity of finite sequences by Lempel (1976)
  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. (10.1007/978-1-4899-2305-9_20)
  18. H. Herzel, W. Ebeling, A.O. Schmitt, Entropies of biosequences: The role of repeats, Phys. Rev. E (1994) 5061–5071. (10.1103/PhysRevE.50.5061)
  19. 10.1137/1104033 / Theory Prob. Appl. / On a statistical estimate for the entropy of a sequence of independent random variables by Basharin (1959)
  20. M. Eigen et al., How old is the genetic code? Statistical geometry of tRNA provides an answer, Science 244 (1989) 673. (10.1126/science.2497522)
  21. 10.1093/nar/24.1.68 / Nucl. Acids Res. / Compilation of tRNA sequences and sequences of tRNA genes by Sprinzl (1996)
  22. 10.1130/0091-7613(1992)020<0983:EOBCAI>2.3.CO;2 / Geology / Evolution of biological complexity and its relation to taxonomic longevity in the Ammonoidea by Boyajian (1992)
  23. C. Adami, Introduction to Artificial Life, TELOS, Springer, New York, 1998. (10.1007/978-1-4612-1650-6)
  24. 10.1016/0167-2789(95)00107-F / Physica D / Universal computation and physical dynamics by Bennett (1995)
Dates
Type When
Created 23 years, 1 month ago (July 25, 2002, 4:09 p.m.)
Deposited 5 years, 7 months ago (Jan. 29, 2020, 11:03 p.m.)
Indexed 3 months ago (May 25, 2025, 8:42 a.m.)
Issued 25 years, 5 months ago (March 1, 2000)
Published 25 years, 5 months ago (March 1, 2000)
Published Print 25 years, 5 months ago (March 1, 2000)
Funders 0

None

@article{Adami_2000, title={Physical complexity of symbolic sequences}, volume={137}, ISSN={0167-2789}, url={http://dx.doi.org/10.1016/s0167-2789(99)00179-7}, DOI={10.1016/s0167-2789(99)00179-7}, number={1–2}, journal={Physica D: Nonlinear Phenomena}, publisher={Elsevier BV}, author={Adami, C. and Cerf, N.J.}, year={2000}, month=mar, pages={62–69} }