2021•Mathematical logic quarterlyRequires access

Bernoulli randomness and Bernoulli normality

Andrew DeLapo

Open publisher page 0 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Bernoulli's principle, Randomness, Bernoulli scheme, Bernoulli process, Bernoulli distribution, Mathematics, Measure (data warehouse), Bernoulli polynomials

Related papers

Back to paper searchBrowse research topicsOriginal source
Bernoulli randomness and Bernoulli normality — Research Paper | ScholarLens