SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
The very first Kolmogorov's paper on algorithmic information theory was entitled 驴Three approaches to the definition of the quantity of information驴. These three approaches were called combinatorial, probabilistic and algorithmic. Trying to establish formal connections between combinatorial and algorithmic approaches, we prove that any linear inequality involving Kolmogorov complexities could be translated into an equivalent combinatorial statement.