Effective complexity of stationary process realizations

DOI10.3390/e13061200zbMath1301.94042arXiv1001.2686OpenAlexW3098817310MaRDI QIDQ400883

Nihat Ay, Arleta Szkoła, Markus P. Müller

Publication date: 26 August 2014

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.2686

zbMATH Keywords

Kolmogorov complexityShannon entropycoarse effective complexitycomputable stationary processeseffective complexity

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17)

Related Items

A geometric approach to complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sophistication revisited
• Kolmogorov's Structure Functions and Model Selection
• Meaningful Information
• A unified approach to weak universal source coding
• Algorithmic statistics
• Effective Complexity and Its Relation to Logical Depth
• Coding of sources with unknown statistics--I: Probability of encoding error

This page was built for publication: Effective complexity of stationary process realizations