A Remarkable Equivalence Between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness
Abstract
The field of algorithmic randomness studies what it means for infinite binary sequences to be random for some given uncertainty model. Classically, such randomness involves precise uncertainty models, and it is only recently that imprecision has been introduced into this field. As a consequence, the investigation into how imprecision alters our view on random sequences has only just begun. In this contribution, we establish a close and surprising connection between precise and imprecise uncertainty models in this randomness context. In particular, we show that there are stationary imprecise models and non-stationary precise models that have the exact same set of computably random sequences. We also discuss the possible implications of this result for a statistics based on imprecise probabilities.
Cite
Text
Persiau et al. "A Remarkable Equivalence Between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness." Proceedings of the Twelveth International Symposium on Imprecise Probability: Theories and Applications, 2021.Markdown
[Persiau et al. "A Remarkable Equivalence Between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness." Proceedings of the Twelveth International Symposium on Imprecise Probability: Theories and Applications, 2021.](https://mlanthology.org/isipta/2021/persiau2021isipta-remarkable/)BibTeX
@inproceedings{persiau2021isipta-remarkable,
title = {{A Remarkable Equivalence Between Non-Stationary Precise and Stationary Imprecise Uncertainty Models in Computable Randomness}},
author = {Persiau, Floris and De Bock, Jasper and Cooman, Gert},
booktitle = {Proceedings of the Twelveth International Symposium on Imprecise Probability: Theories and Applications},
year = {2021},
pages = {244-253},
volume = {147},
url = {https://mlanthology.org/isipta/2021/persiau2021isipta-remarkable/}
}