Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Normality, Relativization, and Randomness (2312.10204v1)

Published 15 Dec 2023 in math.LO, cs.IT, math.IT, and math.NT

Abstract: Normal numbers were introduced by Borel. Normality is certainly a weak notion of randomness; for instance, there are computable numbers which are absolutely normal. In the present paper, we introduce a relativization of normality to a fixed representation system. When we require normality with respect to large sets of such systems, we find variants of normality that imply randomness notions much stronger than absolute normality. The primary classes of numbers investigated in this paper are the supernormal numbers and the highly normal numbers, which we will define. These are relativizations of normality which are robust to all reasonable changes of representation. Among other results, we give a proof that the highly normal numbers are exactly those of computable dimension 1, which we think gives a more natural characterization than was previously known of this interesting class.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (13)
  1. An example of a computable absolutely normal number. Theoretical Computer Science, 270(1):947–958, 2002.
  2. 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.
  3. Yann Bugeaud. Distribution modulo one and Diophantine approximation, volume 193 of Camb. Tracts Math. Cambridge: Cambridge University Press, 2012.
  4. Approximating functionsand measuring distance on a graph. In Proceedings of the 12th Asian Logic Conference, pages 24–52. Wold Scientific, 2013.
  5. Finite-state dimension. Theoretical Computer Science, 310:1–33, 2004.
  6. D. Doty and P. Moser. Finite-state dimension and lossy decompressors. Technical Report CoRR abs/cs/0609096, Arxiv, 2006.
  7. J. M. Hitchcock. Correspondence principles for effective dimensions. Theory of Computing Systems, 38:559–571, 2005.
  8. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32(5):1236–1259, 2003.
  9. J. H. Lutz and E. Mayordomo. Computing absolutely normal numbers in nearly linear time. Information and Computation, 281, 2021.
  10. Elvira Mayordomo. A point to set principle for finite-state dimension. Technical Report arXiv:2208.00157, Arxiv, 2022.
  11. K. Popper. The Logic of Scientific Discovery. Routledge, 2nd edition, 2002. first edition published 1935.
  12. C. P. Schnorr and H. Stimm. Endliche automaten und zufallsfolgen. Acta Informatica, 1:345–359, 1972.
  13. 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].

Summary

We haven't generated a summary for this paper yet.