On the rate of decrease in logical depth

DOI10.1016/j.tcs.2017.08.012zbMath1380.68238DBLPjournals/tcs/AntunesSV17OpenAlexW2748419703WikidataQ62038761 ScholiaQ62038761MaRDI QIDQ1676323

L. F. Antunes, André Souto, Paul M. B. Vitányi

Publication date: 6 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/26768

zbMATH Keywords

Kolmogorov complexitycompressionlogical depth

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines

Cites Work

• Unnamed Item
• On Non-Computable Functions
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: On the rate of decrease in logical depth