Effective Complexity and Its Relation to Logical Depth
From MaRDI portal
Publication:5281310
DOI10.1109/TIT.2010.2053892zbMath1366.94163MaRDI 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
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
94A17: Measures of information, entropy
94A15: Information theory (general)
62B10: Statistical aspects of information-theoretic topics
Related Items
A geometric approach to complexity, Natural complexity, computational complexity and depth, Effective complexity of stationary process realizations, Sophistication vs logical depth, Unpredictability and Computational Irreducibility