Measuring static complexity

Ben Goertzel

International Journal of Mathematics and Mathematical Sciences, 1992, vol. 15, 1-14

Abstract:

The concept of pattern is introduced, formally defined, and used to analyze various measures of the complexity of finite binary sequences and other objects. The standard Kolmogoroff-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.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/15/743635.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/15/743635.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:743635

DOI: 10.1155/S0161171292000188

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().