Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences

被引：0

作者：

Zimand, Marius ^{[1
]}

机构：

[1] Towson Univ, Dept Comp & Informat Sci, Baltimore, MD 21204 USA

来源：

COMPUTER SCIENCE - THEORY AND APPLICATIONS | 2008年 / 5010卷

关键词：

Kolmogorov complexity; Hausdorff dimension;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure that transforms one input sequence into another sequence with higher randomness rate. By contrast, we display such a uniform effective procedure having as input two independent sequences with positive but arbitrarily small constant randomness rate. Moreover the transformation is a truth-table reduction and the output has randomness rate arbitrarily close to 1.

引用

页码：326 / 338

页数：13

共 14 条

[1] Extracting randomness using few independent sources [J].

Barak, B ;

Impagliazzo, R ;

Wigderson, A .

45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, :384-393

[2]

BIENVENU L, 2007, LNCS, V4497

[3]

Buhrman H, 2005, LECT NOTES COMPUT SC, V3404, P412

[4]

CALUDE C, 2008, ARXIV08020487 CORR

[5]

DOTY D, 2007, ARXIV060607 IN PRESS

[6]

Fortnow L, 2006, LECT NOTES COMPUT SC, V4051, P335, DOI 10.1007/11786986_30

[7] The dimensions of individual strings and sequences [J].

Lutz, JH .

INFORMATION AND COMPUTATION, 2003, 187 (01) :49-79

[8] A Kolmogorov complexity characterization of constructive Hausdorff dimension [J].

Mayordomo, E .

INFORMATION PROCESSING LETTERS, 2002, 84 (01) :1-3

[9] Randomness and computability: Open questions [J].

Miller, Joseph S. ;

Nies, Andre .

BULLETIN OF SYMBOLIC LOGIC, 2006, 12 (03) :390-410

[10]

NIES A, 2006, P IMS WORKS IN PRESS

← 1 2 →