Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 423

The DOI matches its Crossref record.

Measures of complexity: a nonexhaustive list

·2001·IEEE Control Systems

Abstract

The world has grown more complex recently, and the number of ways of measuring complexity has grown even faster. This multiplication of measures has been taken by some to indicate confusion in the field of complex systems. In fact, the many measures of complexity represent variations on a few underlying themes. This column presents an (incomplete) categorization and tabulation of measures of complexity. An historical analog to the problem of measuring complexity is the problem of describing electromagnetism before Maxwell’s equations. In the case of electromagnetism, quantities such as electric and magnetic forces that arose in different experimental contexts were originally regarded as fundamentally different. Eventually it became clear that electricity and magnetism were in fact closely related aspects of the same fundamental quantity, the electromagnetic field. Similarly, contemporary researchers in architecture, biology, computer science, dynamical systems, engineering, finance, game theory, etc., have defined different measures of complexity for each field. Because these researchers were asking the same questions about the complexity of their different subjects of research, however, their answers have much in common. Three questions that are frequently posed when attempting to quantify the complexity of the thing (house, bacterium, problem, process, investment scheme) under study are 1) How hard is it to describe? 2) How hard is it to create? 3) What is its degree of organization? I use these questions to group measures of complexity. Measures within a group are typically closely related quantities.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/mcs.2001.939938

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 423

Metadata

Venue
IEEE Control Systems
Published
2001-08
Volume
21
Issue
4
Pages
7-8
ISSN
  • 1066-033X (ISSN-L)
  • 1941-000X
OpenAlex
W2163236190
Cited by
423
References
0
FWCI
0.46
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: Measures of complexity: a nonexhaustive list. https://app.cochat.ai/papers/10.1109/mcs.2001.939938
The paper
Measures of complexity: a nonexhaustive list. (2001). IEEE Control Systems. https://doi.org/10.1109/mcs.2001.939938

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.