An additivity theorem for plain Kolmogorov complexity
From MaRDI portal
Publication:1946492
DOI10.1007/s00224-012-9385-4zbMath1263.68053arXiv1111.4372OpenAlexW1977114030WikidataQ57349491 ScholiaQ57349491MaRDI QIDQ1946492
Publication date: 15 April 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.4372
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)
Related Items
Cites Work