Skip to search formSkip to main contentSkip to account menu

Kolmogorov complexity

Known as: K-complexity, Entropy (disambiguation), Chaitin–Kolmogorov randomness 
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Active networkingBerry paradoxBinary combinatory logicBusy beaver

Broader (1)

Information theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Resolving high Reynolds numbers in SPH simulations of subsonic turbulence
Accounting for the Reynolds number is critical in numerical simulations of turbulence, particularly for subsonic flow. For… 
Highly Cited
2009
Highly Cited
2009
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh… 
2009
2009
Complexity Control of H.264/AVC Based on Mode-Conditional Cost Probability Distributions
A computational complexity control algorithm is proposed for an H.264 encoder running on a processor/power constrained platform… 
2007
2007
Magnetic field near the central region of the Galaxy: rotation measure of extragalactic sources
Aims. We determine the properties of the Faraday screen and the magnetic field near the central region of the Galaxy. Methods. We… 
2006
2006
On Lempel-Ziv Complexity of Sequences
We derive recurrences for counting the number a(n,r) of sequences of length n with Lempel-Ziv complexity r, which has important… 
2006
2006
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
Highly Cited
2003
Highly Cited
2003
Early statistical anomaly intrusion detection of DOS attacks using MIB traffic parameters
We investigate the statistical anomaly detection of DOS computer network attacks using only MIB II supplied traffic parameters of… 
1997
1997
Genetic Programming Estimates of Kolmogorov Complexity
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming… 
1997
1997
ON ENTROPY RATES OF DYNAMICAL SYSTEMS AND GAUSSIAN PROCESSES
1991
1991
Some Theory of Statistical Inference for Nonlinear Science: Expanded Version
This article shows how standard errors can be estimated for a measure of the number of excited degrees of freedom (the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)