ReviewEntropy (Basel, Switzerland)2020
A Review of Methods for Estimating Algorithmic Complexity: Options, Challenges, and New Directions.
Review in Entropy (Basel, Switzerland), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 17 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
17 citing papers in PubMed.
- SuperARC: a test for artificial superintelligence based on compressed modelling, recursive prediction and problem complexity.Nature communications · 2026Article
- On the Empirical Agreement Between Compression and Program-Execution Approaches to Algorithmic Complexity: A Controlled Study Using BDM.Entropy (Basel, Switzerland) · 2026Article
- Task-related differences in network connectivity and dynamics in people with severe opioid use disorder compared with healthy controls.Translational psychiatry · 2026Article
- Binarized neural networks converge toward algorithmic simplicity: empirical support for the learning-as-compression hypothesis.Frontiers in computational neuroscience · 2026Article
- When prediction fails: a computational complexity view of stress.Frontiers in veterinary science · 2026Article
- The future of fundamental science led by generative closed-loop artificial intelligence.Frontiers in artificial intelligence · 2026Review
- Entropy and Complexity Tools Across Scales in Neuroscience: A Review.Entropy (Basel, Switzerland) · 2025Review
- Structured Dynamics in the Algorithmic Agent.Entropy (Basel, Switzerland) · 2025Article
- An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity.Entropy (Basel, Switzerland) · 2024Article
- On the salient limitations of the methods of assembly theory and their classification of molecular biosignatures.NPJ systems biology and applications · 2024Review
- Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory.Entropy (Basel, Switzerland) · 2024Article
- Effects of External Stimulation on Psychedelic State Neurodynamics.ACS chemical neuroscience · 2024Article
- Emergence and algorithmic information dynamics of systems and observers.Philosophical transactions. Series A, Mathematical, physical, and engineering sciences · 2022Article
- Kolmogorov compression complexity may differentiate different schools of Orthodox iconography.Scientific reports · 2022Article
- Language of fungi derived from their electrical spiking activity.Royal Society open science · 2022Article
- Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results.Frontiers in computational neuroscience · 2022Article
- The Complex Structure of the Pharmacological Drug-Disease Network.Entropy (Basel, Switzerland) · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging from dominant ones such as statistical lossless compression to newer approaches that advance, complement and also pose new challenges and may exhibit their own limitations. Evidence suggesting that these different methods complement each other for different regimes is presented and despite their many challenges, some of these methods can be better motivated by and better grounded in the principles of algorithmic information theory. It will be explained how different approaches to algorithmic complexity can explore the relaxation of different necessary and sufficient conditions in their pursuit of numerical applicability, with some of these approaches entailing greater risks than others in exchange for greater relevance. We conclude with a discussion of possible directions that may or should be taken into consideration to advance the field and encourage methodological innovation, but more importantly, to contribute to scientific discovery. This paper also serves as a rebuttal of claims made in a previously published minireview by another author, and offers an alternative account.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.