Bernoulli randomness and Bernoulli normality

Mathematical Logic Quarterly 67 (3):359-373 (2021)
  Copy   BIBTEX

Abstract

One can consider μ‐Martin‐Löf randomness for a probability measure μ on 2ω, such as the Bernoulli measure given. We study Bernoulli randomness of sequences in with parameters, and we reintroduce Bernoulli normality, where the uniform distribution of digits is replaced with a Bernoulli distribution. We prove the equivalence of three characterizations of Bernoulli normality. We show that every Bernoulli random real is Bernoulli normal, and this has the corollary that the set of Bernoulli normal reals has full Bernoulli measure in. We give an algorithm for computing Bernoulli normal sequences from normal sequences so that we can give explicit examples of Bernoulli normal reals. We investigate an application of randomness to iterated function systems. Finally, we list a few further questions relating to Bernoulli randomness and Bernoulli normality.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

How much randomness is needed for statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen - 2014 - Annals of Pure and Applied Logic 165 (9):1470-1483.

Analytics

Added to PP
2023-08-30

Downloads
4 (#1,643,353)

6 months
3 (#1,206,449)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references