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...
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...
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...