scientific article
From MaRDI portal
Publication:3530401
zbMath1158.03026MaRDI QIDQ3530401
Publication date: 20 October 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items
Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension ⋮ Algorithmically Independent Sequences ⋮ 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
