Limitations of Efficient Reducibility to the Kolmogorov Random Strings
From MaRDI portal
Publication:4904457
DOI10.3233/COM-2012-006zbMath1284.68308OpenAlexW408445797MaRDI QIDQ4904457
Publication date: 30 January 2013
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/com-2012-006
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items