Normality, Relativization, and Randomness
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.
- An example of a computable absolutely normal number. Theoretical Computer Science, 270(1):947–958, 2002.
- M. Émile Borel. Les probabilités dénombrables et leurs applications arithmétiques. Rendiconti del Circolo Matematico di Palermo (1884-1940), 27:247–271, 1909.
- Yann Bugeaud. Distribution modulo one and Diophantine approximation, volume 193 of Camb. Tracts Math. Cambridge: Cambridge University Press, 2012.
- Approximating functionsand measuring distance on a graph. In Proceedings of the 12th Asian Logic Conference, pages 24–52. Wold Scientific, 2013.
- Finite-state dimension. Theoretical Computer Science, 310:1–33, 2004.
- D. Doty and P. Moser. Finite-state dimension and lossy decompressors. Technical Report CoRR abs/cs/0609096, Arxiv, 2006.
- J. M. Hitchcock. Correspondence principles for effective dimensions. Theory of Computing Systems, 38:559–571, 2005.
- J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5):1236–1259, 2003.
- J. H. Lutz and E. Mayordomo. Computing absolutely normal numbers in nearly linear time. Information and Computation, 281, 2021.
- Elvira Mayordomo. A point to set principle for finite-state dimension. Technical Report arXiv:2208.00157, Arxiv, 2022.
- K. Popper. The Logic of Scientific Discovery. Routledge, 2nd edition, 2002. first edition published 1935.
- C. P. Schnorr and H. Stimm. Endliche automaten und zufallsfolgen. Acta Informatica, 1:345–359, 1972.
- A. M. Turing. A note on normal numbers. In S. Barry Cooper and J. van Leeuwen, editors, Alan Turing: His Work and Impact. Elsevier Science, 2013. Written on the back of a copy of [Turi36].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.