Random sequence generation by cellular automata

[1]  Erica Jen,et al.  Global properties of cellular automata , 1986 .

[2]  Y. Sinai An answer to a question by J. Milnor , 1985 .

[3]  Stephen Wolfram Cryptography with Cellular Automata , 1985, CRYPTO.

[4]  Wolfram,et al.  Origins of randomness in physical systems. , 1985, Physical review letters.

[5]  Kenneth Steiglitz,et al.  A multi-processor cellular automaton chip , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  Wolfram,et al.  Undecidability and intractability in theoretical physics. , 1985, Physical review letters.

[7]  Jeffrey C. Lagarias,et al.  The 3x + 1 Problem and its Generalizations , 1985 .

[8]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[9]  S. Wolfram Geometry of Binomial Coefficients , 1984 .

[10]  Stephen Wolfram,et al.  Cellular automata as models of complexity , 1984, Nature.

[11]  Stephen Wolfram,et al.  Computer Software in Science and Mathematics. , 1984 .

[12]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[13]  A. Odlyzko,et al.  Algebraic properties of cellular automata , 1984 .

[14]  S. Wolfram Computation theory of cellular automata , 1984 .

[15]  Tommaso Toffoli,et al.  CAM: A high-performance cellular-automaton machine , 1984 .

[16]  N. Margolus Physics-like models of computation☆ , 1984 .

[17]  P. Holmes,et al.  Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields , 1983, Applied Mathematical Sciences.

[18]  S. Wolfram Statistical mechanics of cellular automata , 1983 .

[19]  Adi Shamir,et al.  On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.

[20]  Stephen Wolfram,et al.  Universality and complexity in cellular automata , 1983 .

[21]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[22]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[23]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[24]  Adi Shamir,et al.  On the Generation of Cryptographically Strong Pseudo-Random Sequences , 1981, ICALP.

[25]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  G. Chaitin Randomness and Mathematical Proof , 1975 .

[28]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[29]  W. A. Beyer,et al.  Statistical Study of Digits of Some Square Roots of Integers in Various Bases , 1970 .

[30]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.

[31]  K. Mahler,et al.  An unsolved problem on the powers of 3/2 * , 1968 .

[32]  G. W. Snedecor STATISTICAL METHODS , 1967 .

[33]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[34]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[35]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[36]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[37]  B. Harris PROBABILITY DISTRIBUTIONS RELATED TO RANDOM MAPPINGS , 1960 .