An example of a computable absolutely normal number
A recursive reformulation of Sierpinski's construction of an absolutely normal number was provided. The reformulation produced a computable absolute normal number in base 2, which was normal in any scale considered. The construction was adapted to define numbers in any other bases and distinct...
| Autores principales: | , |
|---|---|
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v270_n1-2_p947_Becher http://hdl.handle.net/20.500.12110/paper_03043975_v270_n1-2_p947_Becher |
| Aporte de: |
| id |
paper:paper_03043975_v270_n1-2_p947_Becher |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_03043975_v270_n1-2_p947_Becher2023-06-08T15:29:34Z An example of a computable absolutely normal number Becher, Verónica Andrea Figueira, Santiago Daniel Algorithms Approximation theory Convergence of numerical methods Number theory Probability Set theory Absolutely normal numbers Recursive functions A recursive reformulation of Sierpinski's construction of an absolutely normal number was provided. The reformulation produced a computable absolute normal number in base 2, which was normal in any scale considered. The construction was adapted to define numbers in any other bases and distinct numbers were obtained for different bases. Fil:Becher, V. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2002 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v270_n1-2_p947_Becher http://hdl.handle.net/20.500.12110/paper_03043975_v270_n1-2_p947_Becher |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Algorithms Approximation theory Convergence of numerical methods Number theory Probability Set theory Absolutely normal numbers Recursive functions |
| spellingShingle |
Algorithms Approximation theory Convergence of numerical methods Number theory Probability Set theory Absolutely normal numbers Recursive functions Becher, Verónica Andrea Figueira, Santiago Daniel An example of a computable absolutely normal number |
| topic_facet |
Algorithms Approximation theory Convergence of numerical methods Number theory Probability Set theory Absolutely normal numbers Recursive functions |
| description |
A recursive reformulation of Sierpinski's construction of an absolutely normal number was provided. The reformulation produced a computable absolute normal number in base 2, which was normal in any scale considered. The construction was adapted to define numbers in any other bases and distinct numbers were obtained for different bases. |
| author |
Becher, Verónica Andrea Figueira, Santiago Daniel |
| author_facet |
Becher, Verónica Andrea Figueira, Santiago Daniel |
| author_sort |
Becher, Verónica Andrea |
| title |
An example of a computable absolutely normal number |
| title_short |
An example of a computable absolutely normal number |
| title_full |
An example of a computable absolutely normal number |
| title_fullStr |
An example of a computable absolutely normal number |
| title_full_unstemmed |
An example of a computable absolutely normal number |
| title_sort |
example of a computable absolutely normal number |
| publishDate |
2002 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v270_n1-2_p947_Becher http://hdl.handle.net/20.500.12110/paper_03043975_v270_n1-2_p947_Becher |
| work_keys_str_mv |
AT becherveronicaandrea anexampleofacomputableabsolutelynormalnumber AT figueirasantiagodaniel anexampleofacomputableabsolutelynormalnumber AT becherveronicaandrea exampleofacomputableabsolutelynormalnumber AT figueirasantiagodaniel exampleofacomputableabsolutelynormalnumber |
| _version_ |
1768544039120928768 |