Publication:3530401
From MaRDI portal
zbMath1158.03026MaRDI QIDQ3530401
Publication date: 20 October 2008
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension, Algorithmically independent sequences, Turing degrees of reals of positive effective packing dimension, Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences, Dimension extractors and optimal decompression, Algorithmically Independent Sequences