๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Inequalities for Shannon Entropy and Kol
โœ Daniel Hammer; Andrei Romashchenko; Alexander Shen; Nikolai Vereshchagin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 272 KB

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 the Kolmogorov data complexity
โœ Jerzy Tyszkiewicz ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 773 KB

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.

A note on a Kolmogorov inequality
โœ Dean M Young; John W Seaman Jr.; Virgil R Marco ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 59 KB
A note on conditional logics and entropy
โœ Gabriele Kern-Isberner ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 745 KB

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

A note on bounded entropies
โœ Pierre-Olivier Amblard; Christophe Vignat ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB