Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
From MaRDI portal
Publication:3613771
DOI10.1007/11786986_30zbMath1223.68060OpenAlexW1605260458MaRDI QIDQ3613771
A. Pavan, N. V. Vinodchandran, John M. Hitchcock, Fengming Wang, Lance J. Fortnow
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_30
Related Items
Symmetry of Information: A Closer Look, AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES, Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension, On Generating Independent Random Strings, Extracting Kolmogorov complexity with applications to dimension zero-one laws, Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences, Pushdown dimension, Constructive dimension and Turing degrees, Optimal bounds for single-source Kolmogorov extractors, Dimension extractors and optimal decompression, On the Optimal Compression of Sets in PSPACE
