911 search results - page 14 / 183 » Kolmogorov Complexity Cores |
FUIN
2008
14 years 11 months ago
2008
A few years ago a nice criterion of Martin-L
CIKM
2008
Springer
15 years 1 months ago
2008
Springer
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
COCO
2010
Springer
15 years 3 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
114
click to vote
CSR
2011
Springer
14 years 3 months 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...