Approaches to complexity engineering

[1]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[2]  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).

[3]  Alvy Ray Smith,et al.  Simple Computation-Universal Cellular Spaces , 1971, JACM.

[4]  S. Wolfram,et al.  Two-dimensional cellular automata , 1985 .

[5]  S. Kirkpatrick,et al.  Configuration space analysis of travelling salesman problems , 1985 .

[6]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Richard W. Hamming,et al.  Coding and Information Theory , 1980 .

[8]  Antonio Grasselli,et al.  Synchronization of Cellular Arrays: The Firing Squad Problem in Two Dimensions , 1975, Inf. Control..

[9]  G. Y. Vichniac,et al.  Annealed and quenched inhomogeneous cellular automata (INCA) , 1986 .

[10]  Kendall Preston,et al.  Modern Cellular Automata , 1984, Advanced Applications in Pattern Recognition.

[11]  Douglas B. Lenat.  Computer Software for Intelligent Systems. , 1984 .

[12]  W. Kinzel.  Phase transitions of cellular automata , 1985 .

[13]  G. Vichniac.  Simulating physics with cellular automata , 1984 .

[14]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

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

[16]  Eytan Domany,et al.  Equivalence of Cellular Automata to Ising Models and Directed Percolation , 1984 .

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

[18]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

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

[20]  Barr and Feigenbaum Edward A. Avron.  The Handbook of Artificial Intelligence , 1981 .

[21]  Curtis F. Gerald.  Applied numerical analysis , 1970 .

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

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

[24]  S. Kauffman.  Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

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

[26]  John H. Holland,et al.  Genetic Algorithms and Adaptation , 1984 .

[27]  S. Wolfram.  Random sequence generation by cellular automata , 1986 .

[28]  Erica Jen.  Invariant strings and pattern-recognizing properties of one-dimensional cellular automata , 1986 .

[29]  J. Yorke,et al.  Fractal basin boundaries , 1985 .

[30]  T. E. Ingerson,et al.  Structure in asynchronous cellular automata , 1984 .

[31]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[32]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[33]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[34]  Robert P. W. Duin,et al.  Progress report on pattern recognition , 1980 .

[35]  B. Huberman,et al.  Parallel computing structures capable of flexible associations and recognition of fuzzy inputs , 1985 .