84 search results - page 2 / 17 » Kolmogorov complexity and set theoretical representations of... |
MFCS
1997
Springer
13 years 11 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 signiļ¬cant simpliļ¬...
MFCS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for preļ¬xfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
COCO
2003
Springer
14 years 2 days ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
NIPS
2007
13 years 8 months ago
2007
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...