Normal numbers and computer science
Émile Borel defined normality more than 100 years ago to formalize the most basic form of randomness for real numbers. A number is normal to a given integer base if its expansion in that base is such that all blocks of digits of the same length occur in it with the same limiting frequency. This chap...
| Autores principales: | , |
|---|---|
| Formato: | SER |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_22970215_v_n9783319691510_p233_Becher |
| Aporte de: |
| id |
todo:paper_22970215_v_n9783319691510_p233_Becher |
|---|---|
| record_format |
dspace |
| spelling |
todo:paper_22970215_v_n9783319691510_p233_Becher2023-10-03T16:40:49Z Normal numbers and computer science Becher, V. Carton, O. Émile Borel defined normality more than 100 years ago to formalize the most basic form of randomness for real numbers. A number is normal to a given integer base if its expansion in that base is such that all blocks of digits of the same length occur in it with the same limiting frequency. This chapter is an introduction to the theory of normal numbers. We present five different equivalent formulations of normality, and we prove their equivalence in full detail. Four of the definitions are combinatorial, and one is, in terms of finite automata, analogous to the characterization of Martin-Löf randomness in terms of Turing machines. All known examples of normal numbers have been obtained by constructions. We show three constructions of numbers that are normal to a given base and two constructions of numbers that are normal to all integer bases. We also prove Agafonov’s theorem that establishes that a number is normal to a given base exactly when its expansion in that base is such that every subsequence selected by a finite automaton is also normal. © Springer International Publishing AG, part of Springer Nature 2018. SER info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_22970215_v_n9783319691510_p233_Becher |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| description |
Émile Borel defined normality more than 100 years ago to formalize the most basic form of randomness for real numbers. A number is normal to a given integer base if its expansion in that base is such that all blocks of digits of the same length occur in it with the same limiting frequency. This chapter is an introduction to the theory of normal numbers. We present five different equivalent formulations of normality, and we prove their equivalence in full detail. Four of the definitions are combinatorial, and one is, in terms of finite automata, analogous to the characterization of Martin-Löf randomness in terms of Turing machines. All known examples of normal numbers have been obtained by constructions. We show three constructions of numbers that are normal to a given base and two constructions of numbers that are normal to all integer bases. We also prove Agafonov’s theorem that establishes that a number is normal to a given base exactly when its expansion in that base is such that every subsequence selected by a finite automaton is also normal. © Springer International Publishing AG, part of Springer Nature 2018. |
| format |
SER |
| author |
Becher, V. Carton, O. |
| spellingShingle |
Becher, V. Carton, O. Normal numbers and computer science |
| author_facet |
Becher, V. Carton, O. |
| author_sort |
Becher, V. |
| title |
Normal numbers and computer science |
| title_short |
Normal numbers and computer science |
| title_full |
Normal numbers and computer science |
| title_fullStr |
Normal numbers and computer science |
| title_full_unstemmed |
Normal numbers and computer science |
| title_sort |
normal numbers and computer science |
| url |
http://hdl.handle.net/20.500.12110/paper_22970215_v_n9783319691510_p233_Becher |
| work_keys_str_mv |
AT becherv normalnumbersandcomputerscience AT cartono normalnumbersandcomputerscience |
| _version_ |
1807320482666512384 |