Bernoulli Randomness and Biased Normality

Abstract

One can consider $μ$-Martin-Löf randomness for a probability measure $μ$ on $2^ω$, such as the Bernoulli measure $μ_p$ given $p \in (0, 1)$. We study Bernoulli randomness of sequences in $n^ω$ with parameters $p_0, p_1, \dotsc, p_{n-1}$, and we introduce a biased version of normality. We prove that every Bernoulli random real is normal in the biased sense, and this has the corollary that the set of biased normal reals has full Bernoulli measure in $n^ω$. We give an algorithm for computing biased normal sequences from normal sequences, so that we can give explicit examples of biased normal reals. We investigate an application of randomness to iterated function systems. Finally, we list a few further questions relating to Bernoulli randomness and biased normality.