Von Mises' definition of random sequences reconsidered
- 1 September 1987
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 52 (3) , 725-755
- https://doi.org/10.1017/s0022481200029728
Abstract
We review briefly the attempts to define random sequences (§0). These attempts suggest two theorems: one concerning the number of subsequence selection procedures that transform a random sequence into a random sequence (§§1–3 and 5); the other concerning the relationship between definitions of randomness based on subsequence selection and those based on statistical tests (§4).Keywords
This publication has 13 references indexed in Scilit:
- On the relation between descriptional complexity and algorithmic probabilityTheoretical Computer Science, 1983
- Combinatorial foundations of information theory and the calculus of probabilitiesRussian Mathematical Surveys, 1983
- Algorithmic Information TheoryIBM Journal of Research and Development, 1977
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- Process complexity and effective random testsJournal of Computer and System Sciences, 1973
- Measure and category in effective descriptive set theoryAnnals of Mathematical Logic, 1973
- Subsequences of normal sequencesIsrael Journal of Mathematics, 1973
- Complexity oscillations in infinite binary sequencesProbability Theory and Related Fields, 1971
- On Equivalence of Infinite Product MeasuresAnnals of Mathematics, 1948
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940