A coding theorem for enumerable output machines
From MaRDI portal
Publication:2390302
DOI10.1016/j.ipl.2004.05.002zbMath1178.68247MaRDI QIDQ2390302
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.05.002
algorithmic information theory; Kolmogorov complexity; theory of computation; coding theorem; enumerable output machine
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Cites Work
- Unnamed Item
- On the relation between descriptional complexity and algorithmic probability
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS