References
- Math. comp. v.50 The computation of π to 29,360,000 decimal digits using Borweins'quartically convergent algorithm D. bailey
- Pi:A Source book L. Berggren;J. Borwein;P. Borwein
- Colloq. Math v.84 Average convergence rate of the first return time G. H. Choe;D. H. kim
- Bull. Amer. Math. Soc. v.53 On the notion of recurrence in discrete stochastic processes M. Kac
- Kanada Laboratory Y. Kanda
- The recurrence of blocks for Bernoulli processes k. H. Kim
- J. cryptology v.5 A universal statistical test for random bit generators u. Maurer
- Robert J. Nemiroff R. Nemiroff
- IEEE Trans. inform. Theory v.39 Entropy and data compression schemes D. Ornstein;B. Weiss
- Be.. Sys. Tech. J. v.27 The mathematical theory of communication C. Shannon
- Amer. Math. Soc. v.13 The ergodic theory of discrete Sample Paths P. C. Shields
- Math. Intelligencer v.7 Is π normal? S. Wagon
- An Introduction to Ergodic Theory(2nd edition) p. Walters
- IEEE Trans. Inform. Theory v.35 Some asymptotic properties of the entropy of stationary ergodic data source with applications to data compression A. D. Wyner;J. Ziv
- EIII Trans. Inform. Theory v.23 A universal algorithm for sequential data compression J. Ziv;A. Lempel