# Universal Coding and Prediction on Martin-Löf Random Points

@article{Debowski2020UniversalCA, title={Universal Coding and Prediction on Martin-L{\"o}f Random Points}, author={L. Debowski and Tomasz Steifer}, journal={ArXiv}, year={2020}, volume={abs/2005.03627} }

We perform an effectivization of classical results concerning universal coding and prediction for stationary ergodic processes over an arbitrary finite alphabet. That is, we lift the well-known almost sure statements to statements about Martin-Lof random sequences. Most of this work is quite mechanical but, by the way, we complete a result of Ryabko from 2008 by showing that each universal probability measure in the sense of universal coding induces a universal predictor in the prequential… Expand

#### Supplemental Presentations

#### Topics from this paper

#### References

SHOWING 1-10 OF 31 REFERENCES

Universal prediction and universal coding

- Mathematics, Computer Science
- Systems and Computers in Japan
- 2003

On a definition of random sequences with respect to conditional probability

- Computer Science, Mathematics
- Inf. Comput.
- 2008

A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points

- Computer Science, Mathematics
- Inf. Comput.
- 2012

Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets

- Mathematics
- 2012

Compression-Based Methods of Statistical Analysis and Prediction of Time Series

- Computer Science
- Springer International Publishing
- 2016

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition

- Computer Science
- 2011

Is Natural Language a Perigraphic Process? The Theorem about Facts and Words Revisited

- Computer Science, Medicine
- Entropy
- 2018

Grammar-based codes: A new class of universal lossless source codes

- Computer Science
- IEEE Trans. Inf. Theory
- 2000