Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

APAL
2004

84views more APAL 2004»

The Kolmogorov complexity of random reals

15 years 2 months ago

The Kolmogorov complexity of random reals

Download math.nju.edu.cn

We investigate the initial segment complexity of random reals. Let K( ) denote pre

Liang Yu, Decheng Ding, Rodney G. Downey

Real-time Traffic

APAL 2004 | Initial Segment Complexity | Random Real | Relative Randomness |

claim paper

Related Content

» Kolmogorov Complexity in Randomness Extraction

» Possibilities and impossibilities in Kolmogorov complexity extraction

» Kolmogorov complexity in perspective

» Kolmogorov Complexity in perspective Part I Information Theory and Randomnes

» Reconciling Data Compression and Kolmogorov Complexity

» The complexity of stochastic sequences

» Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

» On partial randomness

» Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extr...

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	APAL
Authors	Liang Yu, Decheng Ding, Rodney G. Downey

Comments (0)