Abstract
We analyze the order of convergence to normality of an algorithm producing the digits of an absolutely normal number in polynomial time. Furthermore, we consider a stronger concept of absolute normality by allowing Pisot numbers of arbitrary degree as bases.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 7 - 29 |
| Fachzeitschrift | Acta arithmetica |
| Jahrgang | 2018 |
| Ausgabenummer | 184 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 2018 |
| Extern publiziert | Ja |
Dieses zitieren
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver