Comment II on "Simple measure for complexity"

被引：24

作者：

Binder, PM

Perry, N

机构：

[1] Univ Los Andes, Dept Fis, Bogota, Colombia

[2] Duke Univ, Dept Phys, Durham, NC 27708 USA

来源：

PHYSICAL REVIEW E | 2000年 / 62卷 / 02期

关键词：

D O I：

10.1103/PhysRevE.62.2998

中图分类号：

O35 [流体力学]; O53 [等离子体物理学];

学科分类号：

070204 ; 080103 ; 080704 ;

摘要：

The measure of complexity recently proposed by Shiner, Davidson, and Landsberg [Phys. Rev. E 59, 1459 (1999)] does not adequately describe the transition from regular to indexed languages observed at the period-doubling accumulation points of quadratic maps. This Comment points to a generic inadequacy of that measure.

引用

收藏

页码：2998 / 2999

页数：2

相关论文

共 18 条

[1] Thermodynamics and complexity of cellular automata [J].

Badii, R ;

Politi, A .

PHYSICAL REVIEW LETTERS, 1997, 78 (03) :444-447

[2] PARAMETRIC ORDERING OF COMPLEX-SYSTEMS [J].

BINDER, PM .

PHYSICAL REVIEW E, 1994, 49 (03) :2023-2025

[3] INFERRING STATISTICAL COMPLEXITY [J].

CRUTCHFIELD, JP ;

YOUNG, K .

PHYSICAL REVIEW LETTERS, 1989, 63 (02) :105-108

[4] HIERARCHICAL APPROACH TO COMPLEXITY WITH APPLICATIONS TO DYNAMIC-SYSTEMS [J].

DALESSANDRO, G ;

POLITI, A .

PHYSICAL REVIEW LETTERS, 1990, 64 (14) :1609-1612

[5]

DERRIDA B, 1978, ANN I H POINCARE A, V29, P305

[6] TOWARD A QUANTITATIVE THEORY OF SELF-GENERATED COMPLEXITY [J].

GRASSBERGER, P .

INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1986, 25 (09) :907-938

[7]

HOPCROFT JE, 1979, INTRO AUOTMATA THEOR

[8] Closed-form analytic maps in one and two dimensions can simulate universal Turing machines [J].

Koiran, P ;

Moore, C .

THEORETICAL COMPUTER SCIENCE, 1999, 210 (01) :217-223

[9] Computational complexity of symbolic dynamics at the onset of chaos [J].

Lakdawala, P .

PHYSICAL REVIEW E, 1996, 53 (05) :4477-4485

[10] COMPUTATION AT THE EDGE OF CHAOS - PHASE-TRANSITIONS AND EMERGENT COMPUTATION [J].

LANGTON, CG .

PHYSICA D, 1990, 42 (1-3) :12-37