On the notion of infinite pseudorandom sequences
- 31 December 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 48, 9-33
- https://doi.org/10.1016/0304-3975(86)90081-2
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- Noncomplex sequences: characterizations and examplesThe Journal of Symbolic Logic, 1976
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- A variant of the Kolmogorov concept of complexityInformation and Control, 1969
- Random Sets in Subrecursive HierarchiesJournal of the ACM, 1969
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- On the size of machinesInformation and Control, 1967
- The definition of random sequencesInformation and Control, 1966
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- On the concept of a random sequenceBulletin of the American Mathematical Society, 1940