4355 search results - page 1 / 871 » Increasing Kolmogorov Complexity |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
COCO
2007
Springer
13 years 11 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
CORR
2008
Springer
13 years 5 months ago
2008
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...
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...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...