Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi

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

zbMATH Keywords

pireproducible computational sciencestatistical randomness

Mathematics Subject Classification ID

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

• Walking on real numbers
• Nonnormality of Stoneham constants
• The Decimal Expansion of π Is Not Statistically Random
• An Empirical Approach to the Normality of π
• Random Generators and Normal Numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Reproducibility in Computational Science: A Case Study: Randomness of the Digits of Pi