Unknown

Dataset Information

A zoo of computable binary normal sequences.


ABSTRACT: Historically there has been a virtual absence of constructive methods to produce broad classes of "certifiably random" infinite sequences, despite considerable interest in this endeavor. Previously, we proved a theorem that yielded explicit algorithms to produce diverse sets of normal numbers, reasonable candidates for random sequences, given their limiting equidistribution of subblocks of all lengths. Herein, we develop this algorithmic approach much further, systematizing the normal number generation process in several ways. We construct delineated, distinct sets of normal numbers (classified by the extent to which initial segments deviate from maximal irregularity), with virtually any allowable specified rate of convergence to 0 of this deviation, encompassing arbitrarily fast and slow

SUBMITTER: Pincus S 

PROVIDER: S-EPMC3511067 | biostudies-literature | 2012 Nov

REPOSITORIES: biostudies-literature