Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,992,848 papers from all fields of science
Search
Sign In
Create Free Account
Kolmogorov complexity
Known as:
K-complexity
, Entropy (disambiguation)
, Chaitin–Kolmogorov randomness
Expand
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Active networking
Berry paradox
Binary combinatory logic
Busy beaver
Expand
Broader (1)
Information theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
ISCO, Lyapunov exponent and Kolmogorov-Sinai entropy for Kerr-Newman Black hole
P. Pradhan
2012
Corpus ID: 118368781
We compute the principal Lyapunov exponent and Kolmogorov-Sinai(KS) entropy for Kerr-Newman black hole space-times and…
Expand
2012
2012
Short communication: An interpretation of the Linux entropy estimator
Benjamin Pousse
IACR Cryptology ePrint Archive
2012
Corpus ID: 17485287
The Linux [1] random number generator (LRNG) aims to produce random numbers with all the limitations due to a deterministic…
Expand
Review
2009
Review
2009
Quantum Algorithmic Complexities and Entropy
F. Benatti
Open systems & information dynamics
2009
Corpus ID: 45733895
We review the basics of classical algorithmic complexity theory and two of its quantum extensions that have been prompted by the…
Expand
2008
2008
Nonparametric steganalysis of QIM data hiding using approximate entropy
Hafiz Malik
,
K.P. Subbalakshmi
,
R. Chandramouli
Electronic imaging
2008
Corpus ID: 16853634
This paper proposes a nonparametric steganalysis method for quantization index modulation (QIM) based steganography. The proposed…
Expand
2007
2007
36. Modeling Annual Maximum Peak Flows at Various Dams and Barrages in Pakistan
Faqir Muhammad
,
Shazia Afreen
2007
Corpus ID: 54816703
The main focus of this paper is to find a suitable distribution for the hydrology series of six catchments in Pakistan. Among…
Expand
2005
2005
Probabilistic Sensitivity Analysis in Engineering Design Using Uniform Sampling and Saddlepoint Approximation
A. Sudjianto
,
Xiaoping Du
,
Wei Chen
2005
Corpus ID: 2048694
Sensitivity analysis plays an important role to help engineers gain knowledge of complex model behaviors and make informed…
Expand
2001
2001
Transport properties of heavy particles in high Reynolds number turbulence
P. Olla
2001
Corpus ID: 17177653
The statistical properties of heavy particle trajectories in high Reynolds numbers turbulent flows are analyzed. Dimensional…
Expand
1997
1997
Genetic Programming Estimates of Kolmogorov Complexity
I. D. Falco
,
M. Conte
,
A. D. Cioppa
,
E. Tarantino
,
G. Trautteur
International Conference on Genetic Algorithms
1997
Corpus ID: 6078613
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming…
Expand
Review
1997
Review
1997
Early acquisition of syntactic categories: A formal model
T. A. Cartwright
,
M. Brent
1997
Corpus ID: 16600412
We propose an explicit, incremental strategy by which children could group words with similar syntactic privileges into discrete…
Expand
1991
1991
Fractal dimensions of lines in chaotic advection
J. Fung
,
J. Vassilicos
1991
Corpus ID: 56413007
The difference between locally self‐similar fractals, called K fractals, and H fractals, which are globally self‐similar fractals…
Expand