Normality, Relativization, and Randomness
Logic
2025-02-18 v2 Information Theory
math.IT
Number Theory
Abstract
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of supernormal numbers that correspond to semicomputable relativizations, and that of highly normal numbers in terms of computable ones. We prove several properties of these new randomness concepts. Both supernormality and high normality generalize Borel absolute normality. Supernormality is strictly between 2-randomness and effective dimension 1, while high normality corresponds exactly to sequences of computable dimension 1 providing a more natural characterization of this class.
Cite
@article{arxiv.2312.10204,
title = {Normality, Relativization, and Randomness},
author = {Wesley Calvert and Emma Grunner and Elvira Mayordomo and Daniel Turetsky and Java Darleen Villano},
journal= {arXiv preprint arXiv:2312.10204},
year = {2025}
}