Physical complexity of symbolic sequences
- 3 January 2000
- journal article
- Published by Elsevier in Physica D: Nonlinear Phenomena
- Vol. 137 (1-2) , 62-69
- https://doi.org/10.1016/s0167-2789(99)00179-7
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- ComplexityPublished by Cambridge University Press (CUP) ,1997
- Algorithmic randomness and physical entropyPhysical Review A, 1989
- Thermodynamic cost of computation, algorithmic complexity and the information metricNature, 1989
- Inferring statistical complexityPhysical Review Letters, 1989
- Complexity as thermodynamic depthAnnals of Physics, 1988
- Combinatorial foundations of information theory and the calculus of probabilitiesRussian Mathematical Surveys, 1983
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- Randomness and Mathematical ProofScientific American, 1975
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966