23 search results - page 1 / 5 » Combinatorial Interpretation of Kolmogorov Complexity |
COCO
2000
Springer
15 years 1 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
100
click to vote
CSR
2011
Springer
14 years 29 days ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
PRICAI
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we address the problem of commonsense reasoning about action by appealing to Occam’s razor—we should accept the simplest hypothesis explaining the obser...
DAGSTUHL
2006
14 years 10 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...