Abstract
In this chapter we will try to get to the heart of the notion of randomness by showing its fundamental connection with several concepts of algorithmic and computational complexity. Although the discussion illuminates the philosophical underpinnings of the concept of randomness for a concrete string of data, the conclusions are sobering: perfectly random strings cannot be produced by any finite algorithms (read, computers). A practical way out of this dilemma is suggested.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographical notes
C. Calude, Theories of Computational Complexity, North Holland, Amsterdam, 1988
M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Springer-Verlag, New York, 1993
G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987
A. Church, On the concept of a random sequence, Bull. Amer. Math. Soc. 46(1940), 130–135.
A.N. Kolmogorov and V.A. Uspensky, Algorithms and randomness, SIAM Journal in Probability Theory and Applications 32(1987), 389–412 (appeared after Kolmogorov’s death in 1987).
P. Martin-Löf, The definition of random sequences, Information and Control 9(1966), 602–619.
R. von Mises, Probability, Statistics and Truth, MacMillan, New York, 1939.
J. Ford, How random is a random coin toss, Physics Today 36(1983), 40–47 (April).
D. E. Knuth, The Art of Computer Programming, Volumes 1–3, Addison-Wesley, Reading, MA, 1973
H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
S. Tezuka, Uniform Random Numbers. Theory and Practice, Kluwer, Boston, 1997.
D.G. Champernowne, The construction of decimals normal in the scale of ten, J. London Math. Soc. 8 (1933), 254–260.
Y. Dodge, A natural random number generator, Int. Stat. Review 64(1996), 329–344
J. Eichenauer-Herrmann, Pseudorandom number generation by nonlinear methods, Int. Stat. Review 63(1995), 247–255.
G. Marsaglia, The Marsaglia Random Number CD ROM Including the Diehard Battery of Tests of Randomness
S. Pincus and B.H. Singer, Randomness and degrees of irregularity, Proc. Natl. Acad. Sci. USA 93 (1996), 2083–2088.
S. Pincus and R.E. Kalman, Not all (possibly) “random” sequences are created equal, Proc. Nall. Acad. Sci. USA 94 (1997), 3513–3518.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Denker, M., Woyczyński, W.A., Ycart, B. (1998). Algorithmic Complexity and Random Strings. In: Introductory Statistics and Random Phenomena. Statistics for Industry and Technology. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-2028-2_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2028-2_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-7388-2
Online ISBN: 978-1-4612-2028-2
eBook Packages: Springer Book Archive