M. Levin's construction of absolutely normal numbers with very low discrepancy
Among the currently known constructions of absolutely normal numbers, the one given by Mordechay Levin in 1979 achieves the lowest discrepancy bound. In this work we analyze this construction in terms of computability and computational complexity. We show that, under basic assumptions, it yields a c...
Guardado en:
| Autores principales: | Álvarez, N., Becher, V. |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00255718_v86_n308_p2927_Alvarez |
| Aporte de: |
Ejemplares similares
-
M. Levin's construction of absolutely normal numbers with very low discrepancy
por: Becher, Verónica Andrea
Publicado: (2017) -
On the construction of absolutely normal numbers
por: Aistleitner, C., et al. -
On the construction of absolutely normal numbers
Publicado: (2017) -
A computable absolutely normal Liouville number
por: Becher, V., et al. -
A computable absolutely normal Liouville number
por: Becher, Verónica Andrea, et al.
Publicado: (2015)