Physical complexity of symbolic sequences

DOI10.1016/S0167-2789(99)00179-7zbMath0951.68514arXivadap-org/9605002OpenAlexW3104060308WikidataQ127725364 ScholiaQ127725364MaRDI QIDQ1969877

Nicolas J. Cerf, Christoph Adami

Publication date: 18 December 2000

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/adap-org/9605002

zbMATH Keywords

Kolmogorov-Chaitin complexity

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19)

Related Items

Complexity analysis to explore the structure of ancient stromatolites, The structural complexity of DNA templates -- implications on cellular complexity, Gaussian curvature of spherical shells: a geometric measure of complexity, What is adaptation and how should it be measured?, Complexity and asymptotic stability in the process of biochemical substance exchange in a coupled ring of cells, Selective pressures on genomes in molecular evolution, Evolutionary dynamics, epistatic interactions, and biological information, Was there an ice cube there or am I just remembering it?: Does the reversibility argument really imply scepticism about records?, Statistical complexity and generalized number system, Co-evolution and information signals in biological sequences, Predictability, Complexity, and Learning, Statistical complexity of the time dependent damped L84 model, The performances of the chi-square test and complexity measures for signal recognition in biological sequences, Statistical complexity of the kicked top model considering chaos, Statistical complexity of the quasiperiodical damped systems, Quantum information as a general paradigm

Uses Software

• avida

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On grammars, complexity, and information measures of biological macromolecules
• Universal computation and physical dynamics
• Combinatorial foundations of information theory and the calculus of probabilities
• A Theory of Program Size Formally Identical to Information Theory
• On the Complexity of Finite Sequences
• Complexity
• On the Length of Programs for Computing Finite Binary Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• On Computable Numbers, with an Application to the Entscheidungsproblem