An example of a computable absolutely normal number

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Becher, V., Figueira, S.
Formato: Artículo publishedVersion
Publicado: 2002
Materias:
Algorithms
Approximation theory
Convergence of numerical methods
Number theory
Probability
Set theory
Absolutely normal numbers
Recursive functions
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v270_n1-2_p947_Becher
https://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v270_n1-2_p947_Becher_oai
Aporte de:
Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires
Descripción
Sumario: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.

Ejemplares similares