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: | Becher, V., Carton, O. |
|---|---|
| Formato: | SER |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_22970215_v_n9783319691510_p233_Becher |
| Aporte de: |
Ejemplares similares
-
Normal numbers and computer science
Publicado: (2018) -
Normal numbers and nested perfect necklaces
por: Becher, V., et al. -
An example of a computable absolutely normal number
por: Becher, V., et al.
Publicado: (2002) -
An example of a computable absolutely normal number
por: Becher, V., et al. -
An example of a computable absolutely normal number
por: Becher, V., et al.
Publicado: (2002)