Poisson generic sequences

TL;DR

This paper discusses Poisson generic real numbers, proving that almost all real numbers are Poisson generic and showing the existence of computable and Martin-Löf random Poisson generic numbers.

Contribution

It transcribes Peres and Weiss' proof and establishes that computable and Martin-Löf random reals are Poisson generic.

Findings

Almost all real numbers are Poisson generic.

Computable Poisson generic instances exist.

Martin-Löf random reals are Poisson generic.

Abstract

Years ago, Zeev Rudnick defined the Poisson generic real numbers by counting the number of occurrences of long blocks of digits in the initial segments of the expansions of the real numbers in a fixed integer base. Peres and Weiss proved that almost all real numbers, with respect to Lebesgue measure, are Poisson generic, but they did not publish their proof. In this note first we transcribe Peres and Weiss' proof and then we show that there are computable Poisson generic instances and that all Martin-L\"of random real numbers are Poisson generic.