Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi
From MaRDI portal
Publication:4976184
DOI10.1080/10586458.2016.1163755zbMath1426.11133OpenAlexW2517939087MaRDI QIDQ4976184
David H. Bailey, Mohsen Reisi, Jonathan M. Borwein, Richard P. Brent
Publication date: 27 July 2017
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10586458.2016.1163755
Number-theoretic algorithms; complexity (11Y16) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (3)
A visual analysis method of randomness for classifying and ranking pseudo-random number generators ⋮ A Holistic Approach to Empirical Analysis: The Insignificance of P, Hypothesis Testing and Statistical Significance* ⋮ Reply to “Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi” [Bailey et al. 17]
Cites Work
This page was built for publication: Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi