Timeline for Is pi a good random number generator?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 15:32 | comment | added | Timothy Chow | @JohnEye : Yes. If you want the $n$th digit of $\pi$ then the complexity of the spigot algorithm increases quasi-linearly with $n$. You don't need to store the previous digits or increase the precision of your computations, but the amount of work needed to compute the $n$th digit does increase as $n$ gets bigger. | |
| Jun 10, 2020 at 13:49 | comment | added | JohnEye | Is it really harder to compute additional digits of pi even when using the spigot algorithm based on the Bailey-Borwein-Plouffe formula? | |
| Dec 19, 2015 at 19:18 | comment | added | Timothy Chow | I recently checked the literature and it looks like I slightly misspoke about an "explicit value of $n$". Salikhov proved that the irrationality measure of $\pi$ is less than $8$, which implies for example that there exists $n_0$ such that for all $n>n_0$, the $n$th through the $8n$th bits of $\pi$ cannot all be zero, but as far as I have been able to tell, there is no effective upper bound on the size of $n_0$. | |
| Jun 8, 2010 at 7:03 | vote | accept | James Propp | ||
| Jun 3, 2010 at 21:04 | history | answered | Timothy Chow | CC BY-SA 2.5 |