2588 search results - page 4 / 518 » Applications of Kolmogorov complexity to computable model th... |
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ļ¬...
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
COLT
2003
Springer
14 years 23 days ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=ālog m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
JCSS
2006
13 years 7 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
EUROGP
2001
Springer
14 years 20 hour ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...