4355 search results - page 14 / 871 » Increasing Kolmogorov Complexity |
FUIN
2008
13 years 8 months ago
2008
A few years ago a nice criterion of Martin-L
STACS
2005
Springer
14 years 2 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
14 years 15 days 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 ...
CICLING
2012
Springer
12 years 4 months ago
2012
Springer
The positional rigidity of graphemes (as well as words considered as single units) in written sequences has been analyzed in this paper using complex network methodology. In partic...
DATAMINE
2006
13 years 8 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...