Measuring static complexity
Summary: The concept of `` pattern is introduced, formally defined, and used to analyse various measures of the complexity of finite binary sequences and other objects. The standard Kolmogorov-Chaitin-Solomonoff complexity measure is considered, along with Bennett's `logical depth', Koppel's 'sophistication', and Chaitin's analysis of the complexity of geometric objects. The pattern-theoretic point of view illuminates the shortcomings of these measures and leads to specific improvements. It gives rise to two novel mathematical concepts --- ``orders of complexity and ``levels of pattern, and it yields a new measure of complexity, the ``structural complexity, which measures the total amount of structure an entity possesses.
- Toward a quantitative theory of self-generated complexity
- Inhomogeneity and complexity measures for spatial patterns
- Strategies for managing the structural and dynamic consequences of project complexity
- Complementarity of information obtained by Kolmogorov and Aksentijevic-Gibson complexities in the analysis of binary time series
- GeoEntropy: a measure of complexity and similarity
- A note on Blum static complexity measures
- scientific article; zbMATH DE number 426141 (Why is no real title available?)
- PROBLEMS WITH COMPLEXITY IN GOLD'S PARADIGM OF INDUCTION Part II: Static Complexity
- scientific article; zbMATH DE number 1360911 (Why is no real title available?)
- MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION
- The complexity of hierarchical systems
- Multiscale structural complexity of natural patterns
- Measuring complexity through average symmetry
- A NEW TWO-DIMENSIONAL COMPLEXITY MEASURE
- On an extension of Krivovichev's complexity measures
- Binary sequences. III: Complexity versus homogeneity and symmetry
This page was built for publication: Measuring static complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186345)
