Simple measure for complexity 论文

1999Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics引用 315
Computability, Logic, AI AlgorithmsEvolutionary Algorithms and ApplicationsStatistical Mechanics and Entropy

详细信息

发表期刊/会议
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
发表日期
1999-02-01
发表年份
1999

关键词

Computability, Logic, AI AlgorithmsEvolutionary Algorithms and ApplicationsStatistical Mechanics and Entropy

摘要

A measure of ``complexity'' is proposed, based on appropriately defined notions of ``order'' and ``disorder,'' which has a considerable degree of flexibility in its dependence on these concepts. The possible functional dependencies which result encompass those of many earlier definitions of complexity. The proposed measure is in principle easy to calculate and has the property of an intensive thermodynamic quantity. With appropriate choices of parameters it behaves similarly to ``effective measure complexity'' for the logistic map. It is also a generalization of the ``normalized complexity'' of L\'opez-Ruiz et al., but does not suffer from ``over-universality.''