It was mentioned by Kolmogorov (1968, IEEE Trans. Inform. Theory 14, 662 664) that the properties of algorithmic complexity and Shannon entropy are similar. We investigate one aspect of this similarity. Namely, we are interested in linear inequalities that are valid for Shannon entropy and for Kolmo
A note on Kolmogorov complexity and entropy
โ Scribed by Yasuichi Horibe
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 105 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We define a new Kolmogorov complexity based measure of complexity of logics. Then we use this new tool to prove a sharp estimate of the length of first order sentences defining nonuniformly more complicated Lindstrijm quantifiers in terms of simpler ones. @ 1997 Published by Elsevier Science B.V.
The principles of maximum entropy and of minimum cross-entropy (ME-principles) provide an elegant and reasonable tool to represent quantified uncertainties within a probabilistic framework. The results the application of these principles yield are not only well behaved in a statistical sense but pro