Effective Complexity and Its Relation to Logical Depth

DOI10.1109/TIT.2010.2053892MaRDI QIDQ5281310zbMATH OpenOpenAlexFDO

Authors Nihat Ay, Arleta Szkoła, Markus Müller

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2010.2053892

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15) Measures of information, entropy (94A17)

Cited in

(7)

• On the rate of decrease in logical depth
• Unpredictability and computational irreducibility
• Effective complexity of stationary process realizations
• Sophistication vs logical depth
• A geometric approach to complexity
• Natural complexity, computational complexity and depth
• On natural representations of objects

This page was built for publication: Effective Complexity and Its Relation to Logical Depth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281310)