18 search results - page 1 / 4 » Initial Segment Complexities of Randomness Notions |
IFIPTCS
2010
13 years 5 months ago
2010
Schnorr famously proved that Martin-L
CCA
2009
Springer
14 years 2 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
APAL
2004
13 years 7 months ago
2004
We investigate the initial segment complexity of random reals. Let K( ) denote pre
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
PAMI
2010
13 years 5 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...