Algorithmic Complexity and Randomness: Recent Developments
- 1 January 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Theory of Probability and Its Applications
- Vol. 37 (1) , 92-97
- https://doi.org/10.1137/1137017
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, SequencesTheory of Probability and Its Applications, 1988
- Von Mises' definition of random sequences reconsideredThe Journal of Symbolic Logic, 1987
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- A Survey of the Theory of Random SequencesPublished by Springer Nature ,1977
- Process complexity and effective random testsJournal of Computer and System Sciences, 1973
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- The definition of random sequencesInformation and Control, 1966
- The Kleene hierarchy classification of recursively random sequencesTransactions of the American Mathematical Society, 1966
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940
- Grundlagen der WahrscheinlichkeitsrechnungMathematische Zeitschrift, 1919