A polynomial-time algorithm for computing absolutely normal numbers
- 1 November 2013
- journal article
- research article
- Published by Elsevier in Information and Computation
- Vol. 232, 1-9
Abstract
No abstract availableKeywords
Funding Information
- CONICET
- Agencia Nacional de Promoción Científica y Tecnológica
- National Science Foundation (DMS-1001551)
- Simons Foundation
This publication has 4 references indexed in Scilit:
- Turing’s unpublished algorithm for normal numbersTheoretical Computer Science, 2007
- An example of a computable absolutely normal numberTheoretical Computer Science, 2002
- Über die Normalität von Zahlen zu verschiedenen BasenActa Arithmetica, 1961
- Les probabilités dénombrables et leurs applications arithmétiquesRendiconti del Circolo Matematico di Palermo Series 2, 1909