Effective Complexity and Its Relation to Logical Depth

DOI10.1109/TIT.2010.2053892zbMath1366.94163OpenAlexW2152331460MaRDI QIDQ5281310

Arleta Szkoła, Nihat Ay, Markus P. 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

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

Related Items (5)

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

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