10 search results - page 1 / 2 » Inequalities for Shannon Entropy and Kolmogorov Complexity |
JCSS
2000
13 years 4 months ago
2000
COCO
2000
Springer
13 years 9 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
CAE
2007
13 years 7 months ago
2007
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...