911 search results - page 1 / 183 » Kolmogorov Complexity Cores |
CIE
2010
Springer
13 years 9 months ago
2010
Springer
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
CORR
2008
Springer
13 years 4 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...
CORES
2005
Springer
13 years 10 months ago
2005
Springer
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...