Artículo
Becher, V.; Figueira, S. "An example of a computable absolutely normal number" (2002) Theoretical Computer Science. 270(1-2):947-958
Este artículo es de Acceso Abierto y puede ser descargado en su versión final desde nuestro repositorio
Consulte la política de Acceso Abierto del editor
Abstract:
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.
Registro:
| Documento: | Artículo |
| Título: | An example of a computable absolutely normal number |
| Autor: | Becher, V.; Figueira, S. |
| Filiación: | Departamento de Computatión, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Buenos Aires, Argentina |
| Palabras clave: | Algorithms; Approximation theory; Convergence of numerical methods; Number theory; Probability; Set theory; Absolutely normal numbers; Recursive functions |
| Año: | 2002 |
| Volumen: | 270 |
| Número: | 1-2 |
| Página de inicio: | 947 |
| Página de fin: | 958 |
| DOI: | http://dx.doi.org/10.1016/S0304-3975(01)00170-0 |
| Título revista: | Theoretical Computer Science |
| Título revista abreviado: | Theor Comput Sci |
| ISSN: | 03043975 |
| CODEN: | TCSCD |
| PDF: | https://bibliotecadigital.exactas.uba.ar/download/paper/paper_03043975_v270_n1-2_p947_Becher.pdf |
| Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v270_n1-2_p947_Becher |
Referencias:
- Bailey, D.H., Crandall, R.E., (2000) On the random character of fundamental constant expansions, , http://www.perfsci.com/free/techpapers/freepapers.html
- Borel, E., Les probabilités dénombrables et leurs applications arithmétiques (1909) Rend. Circ. Mat. Palermo, 27, pp. 247-271
- Chaitin, G.J., A theory of program size formally identical to information theory (1975) ACM, 22, pp. 329-340
- Martin, G., Absolutely abnormal numbers Amer. Math. Monthly, , to appear
- Sierpinski, M.W., Démonstration élémentaire du théorème de M. Borel sur les nombres absolument normaux et détermination effective d'un tel nombre (1917) Bull. Soc. Math. France, 45, pp. 127-132
- Sierpinski, M.W., (1964) Elementary Theory of Numbers, Polska Akademia Nauk Monografie Mathematyczne, 44. , Warszawa
- Turing, A., A note on normal numbers (1992) Collected Works of A. M. Turing, Pure Mathematics, pp. 117-119. , J.L. Britton (Eds.), North-Holland, Amsterdam
Citas:
---------- APA ----------
Becher, V. & Figueira, S. (2002) . An example of a computable absolutely normal number. Theoretical Computer Science, 270(1-2), 947-958.http://dx.doi.org/10.1016/S0304-3975(01)00170-0
---------- CHICAGO ----------
Becher, V., Figueira, S. "An example of a computable absolutely normal number" . Theoretical Computer Science 270, no. 1-2 (2002) : 947-958.http://dx.doi.org/10.1016/S0304-3975(01)00170-0
---------- MLA ----------
Becher, V., Figueira, S. "An example of a computable absolutely normal number" . Theoretical Computer Science, vol. 270, no. 1-2, 2002, pp. 947-958.http://dx.doi.org/10.1016/S0304-3975(01)00170-0
---------- VANCOUVER ----------
Becher, V., Figueira, S. An example of a computable absolutely normal number. Theor Comput Sci. 2002;270(1-2):947-958.http://dx.doi.org/10.1016/S0304-3975(01)00170-0
