Measuring static complexity

DOI10.1155/S0161171292000188MaRDI QIDQ1186345zbMATH OpenOpenAlexFDO

Authors Ben Goertzel

Publication date 28 June 1992

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46671

zbMATH Keywords

algorithmic informationdepthKolmogorov complexitypatternsophisticationstructure

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 4072382
• Toward a quantitative theory of self-generated complexity
• On minimal-program complexity measures
• MEASURING COMPLEXITY: A RELATIVE ASPECT OF PATTERN RECOGNITION
• Binary sequences. I: Complexity

Cited in

(16)

• 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)