The DOI matches its Crossref record.
What Is Complexity?
Abstract
It would require many different concepts to capture all our notions of the meaning of complexity. The concept that comes closest to what we usually mean is effective complexity (EC). Roughly speaking, the EC of an entity is the length of a very concise description of its regularities. A novel is considered complex if it has a great many scenes, subplots, characters, and so forth. An elaborate hierarchy can contribute to complexity, as in the case of nested industrial clusters each composed of a great variety of firms and other institutions. In general, though, what are regularities? We encounter in many different situations the interplay between the regular and the random or incidental: music and static on the radio, specifications and tolerances in manufacturing, etc. But ultimately the distinction between the regular and the incidental depends on a judgment of what is important, although the judge need not be human or even alive. For instance, in the case of songs of a male bird in the nesting season, the identification of regularities is perhaps best left to the other birds of the same species — what features are essential in repelling other males from the territory or attracting a suitable female? A technical definition of EC involves the quantity called algorithmic information content (AIC). The description of an entity is converted to a bit string and a standard universal computer is programmed to print out that string and then halt. The length of the shortest such program (or, in a generalization, the shortest that executes within a given time) is the AIC. The AIC is expressed as the sum of two terms, one (the EC) referring to the regularities and the other to the random features. The regularities of a real entity are best expressed by embedding it conceptually in a set of comparable things, the rest of which are imagined. The EC can then be related to the AIC of the set, the choice of which is restricted by the conditions imposed by the judge. Theorists like to study highly simplified models of complex systems, often by computer modelling. What can be claimed for such models? Overall agreement with observation is hardly to be expected. However, in many cases simple regularities can be found in both the observational data and the model, which may then be helpful in understanding those regularities. Examples are given, involving scaling laws and also “implicational scales”. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Cited by
Wireless sensor networks: a survey
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00302-4 · Cited by 17,418
Ladyman, J., Lambert, J., & Wiesner, K. (2013) · European Journal for Philosophy of Science · doi:10.1007/s13194-012-0056-8 · Cited by 846
Complexity measures of supervised classification problems
Ho, T. K., & Basu, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990132 · Cited by 734
Dynamical memristors for higher-complexity neuromorphic computing
Kumar, S., Wang, X., Strachan, J. P., Yang, Y., & Lu, W. D. (2022) · Nature Reviews Materials · doi:10.1038/s41578-022-00434-z · Cited by 558
Changing complexity in human behavior and physiology through aging and disease
Vaillancourt, D. E., & Newell, K. M. (2002) · Neurobiology of Aging · doi:10.1016/s0197-4580(01)00247-0 · Cited by 551
Metadata
- Authors
- Gell-Mann, M.
- Venue
- Contributions to Economics
- Publisher
- Physica-Verlag HD
- Published
- 2002
- Pages
- 13-24
- ISSN
- 1431-1933 (ISSN-L)
- OpenAlex
- W1585976120
- Cited by
- 455
- References
- 0
- FWCI
- 66.41
- Type
- book chapter
- 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: What Is Complexity? https://app.cochat.ai/papers/10.1007/978-3-642-50007-7_2
- The paper
- Gell-Mann, M. (2002). What Is Complexity? Contributions to Economics. https://doi.org/10.1007/978-3-642-50007-7_2
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.