A coding theorem for enumerable output machines

DOI10.1016/j.ipl.2004.05.002zbMath1178.68247OpenAlexW2035692138MaRDI QIDQ2390302

Jan Poland

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

zbMATH Keywords

algorithmic information theoryKolmogorov complexitytheory of computationcoding theoremenumerable output machine

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

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

This page was built for publication: A coding theorem for enumerable output machines