The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Simple measure for complexity
Abstract
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.''
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communications
Shannon, C. E. (1948) · Cited by 2,080
Complexity, Entropy And The Physics Of Information
H. Zurek, W. (2018) · CRC Press eBooks · doi:10.1201/9780429502880 · Cited by 1,380
Inferring statistical complexity
Crutchfield, J. P., & Young, K. (1989) · Physical Review Letters · doi:10.1103/physrevlett.63.105 · Cited by 1,002
1 A Statistical Measure of ComplexityPreprint
López‐Ruiz, R., Mancini, H., & Calbet, X. (1995) · Cited by 939
A Statistical Measure of Complexity
López-Ruiz, R., Mancini, H. L., & Calbet, X. (1995) · Physics Letters A · doi:10.1016/0375-9601(95)00867-5 · Cited by 920
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
The calculi of emergence: computation, dynamics and induction
Crutchfield, J. P. (1994) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(94)90273-9 · Cited by 754
Toward a quantitative theory of self-generated complexity
Grassberger, P. (1986) · International Journal of Theoretical Physics · doi:10.1007/bf00668821 · Cited by 694
Complexity as thermodynamic depth
Lloyd, S., & Pagels, H. (1988) · Annals of Physics · doi:10.1016/0003-4916(88)90094-2 · Cited by 517
Metadata
- Authors
- Shiner, J. S., Davison, M., & Landsberg, P. T.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 1999-02-01
- Volume
- 59
- Issue
- 2
- Pages
- 1459-1464
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1999518678
- Cited by
- 317
- References
- 18
- FWCI
- 7.70
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Simple measure for complexity. https://app.cochat.ai/papers/10.1103/physreve.59.1459
- The paper
- Shiner, J. S., Davison, M., & Landsberg, P. T. (1999). Simple measure for complexity. Physical Review E. https://doi.org/10.1103/physreve.59.1459
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
