Incompressibility is rejected as a necessary condition for randomness of a digit sequence. Tests for the sequence itself are suggested rather than the process by which it is generated. This leads to the conjecture of an infinite number of compressible random sequences.
Get full access to this article
View all access options for this article.
References
1.
BruggerP. (1997) Variables that influence the generation of random sequences: An update. Perceptual and Motor Skills, 84, 627–661.
2.
BruggerP.PietzschS.WeidmannG.BiroP.AlonE. (1995) Stroop-type interference in random number generation. Psychological Reports, 77, 387–390.
3.
ChaitinG. J. (1975) Randomness and mathematical proof. Scientific American, 232, 47–52.
4.
FalkR.KonoldC. (1997) Making sense of randomness: Implicit encoding as a basis for judgement. Psychological Review, 104, 301–318.
5.
FordJ. (1983) How random is a coin toss?Physics Today, 36(April), 40–47.
6.
Gell-MannM. (1994) The quark and the jaguar: Adventures in the simple and the complex. New York: Freeman.
7.
GinsburgN. (1997) Randomness: The error of the equal-entry matrix. Perceptual and Motor Skills, 85, 1481–1482.
8.
GinsburgN.KarpiukP. (1994) Random generation: Analysis of the responses. Perceptual and Motor Skills, 79, 1059–1067.
9.
HerzogG. R. (1989) Die Zufallskonzepttheorie: Experimente zur Vorstellung vom Aufbau von Zufallsreihen. Zeitschrift für experimentelle und angewandte Psychologie, 36, 199–220.
10.
KendallM. G.Babington SmithB. (1938) Randomness and random sampling numbers. Journal of the Royal Statistical Society, 101, 147–166.
11.
LopesL. L. (1982) Doing the impossible: A note on induction and the experience of randomness. Journal of Experimental Psychology: Learning, Memory, and Cognition, 8, 626–636.
12.
MetropolisN. C.ReitwiesnerG.Von NeumannJ. (1950) Statistical treatment of values of first 2000 decimal digits of e and π calculated on the ENIAC. Mathematics of Computation, 4, 109–111.
PetersonI. (1998) The jungles of randomness: A mathematical safari. New York: Wiley.
16.
PincusS.KalmanR. E. (1997) Not all (possibly) “random” sequences are created equal. Proceedings of the National Academy of Science, 94, 3513–3518.
17.
PincusS.SingerB. H. (1996) Randomness and degrees of irregularity. Proceedings of the National Academy of Science, 93, 2083–2088.
18.
ReichenbachH. (1949) The theory of probability. Berkeley, CA: Univer. of California Press.
19.
ShanksD.WrenchJ. (1962) Calculation of π to 100,000 decimals. Mathematics of Computation, 16, 76–99.
20.
Soft Warehouse. (1988) Derive, a mathematical assistant, Version 1.62. Honolulu, HI: Soft Warehouse.
21.
SpattJ. (1996) Evaluation of a simulation of human performance on random-digit generation: Measures of concept and redundancy. Perceptual and Motor Skills, 83, 319–322.
22.
WiegersmaS. (1982) Can repetition avoidance in randomization be explained by randomness concepts?Psychological Research, 44, 189–198.
