Inequalities for Shannon entropy and Kolmogorov complexity
Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Recursively enumerable reals and Chaitin &OHgr; numbers
Theoretical Computer Science
Upper semi-lattice of binary strings with the relation "x is simple conditional to y"
Theoretical Computer Science
Conditional complexity and codes
Theoretical Computer Science
Combinatorial interpretation of Kolmogorov complexity
Theoretical Computer Science
Randomness and Recursive Enumerability
SIAM Journal on Computing
A Criterion for Extractability of Mutual Information for a Triple of Strings
Problems of Information Transmission
Partitioning multi-dimensional sets in a small number of "Uniform" parts
European Journal of Combinatorics
An Introduction to Kolmogorov Complexity and Its Applications
An Introduction to Kolmogorov Complexity and Its Applications
Cryptographic Security of Individual Instances
Information Theoretic Security
Hilbert's Thirteenth Problem and Circuit Complexity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Forbidden substrings, kolmogorov complexity and almost periodic sequences
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On a relation between information inequalities and group theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity are compared with their counterparts not involving complexity.