A coding theorem for enumerable output machines

Authors:
Jan Poland
Affiliations:
IDSIA, Galleria 2, CH-6928 Manno, Lugano, Switzerland
Venue:
Information Processing Letters
Year:
2004

Citing 2
Cited 1

An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
Algorithmic Theories of Everything

Algorithmic Theories of Everything

Prefix-Like complexities and computability in the limit

CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers

Quantified Score

Hi-index	0.89

Visualization

Abstract

Recently, Schmidhuber proposed a new concept of generalized algorithmic: complexity. It allows for the description of both finite and infinite sequences. The resulting distributions are true probabilities rather than semimeasures. We clarify some points for this setting, concentrating on Enumerable Output Machines. As our main result, we prove a strong coding theorem (without logarithmic correction terms), which was left as an open problem. To this purpose, we introduce a more natural definition of generalized complexity.