Random sequence generation by cellular automata
- 30 June 1986
- journal article
- Published by Elsevier BV in Advances in Applied Mathematics
- Vol. 7 (2), 123-169
- https://doi.org/10.1016/0196-8858(86)90028-x
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Origins of randomness in physical systemsPhysical Review Letters, 1985
- The 3x + 1 Problem and Its GeneralizationsThe American Mathematical Monthly, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Cellular automata as models of complexityNature, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Randomness and Mathematical ProofScientific American, 1975
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- The definition of random sequencesInformation and Control, 1966
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- A formal theory of inductive inference. Part IInformation and Control, 1964