References

[1] S. Wolfram, ``Cellular automata as models of complexity'', Nature 311 (1984) 419.

[2] J. Hopfield, ``Neural networks and physical systems with emergent collective computational abilities'', Proc. Natl. Acad. Sci. 79 (1982) 2554.

[3] W. Green, Digital image processing, Van Nostrand (1983).

[4] R. Hamming, Coding and information theory, Prentice-Hall (1980).

[5] V. Vulovic and R. Prange, ``Is the toss of a true coin really random?'', Maryland preprint (1985).

[6] S. McDonald, C. Grebogi, E. Ott and J. Yorke, ``Fractal basin boundaries'', Physica 17D (1985) 125.

[7] M. Garey and D. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman (1979).

[8] S. Wolfram, ``Random sequence generation by cellular automata'', Adv. Applied Math. 7, 123--169 (1986).

[9] K. Preston and M. Duff, Modern cellular automata, Plenum (1984).

[10] S. Wolfram, ``Universality and complexity in cellular automata'', Physica 10D (1984) 1.

[11] S. Wolfram, ``Computation theory of cellular automata'', Commun. Math. Phys. 96 (1984) 15.

[12] S. Wolfram, ``Undecidability and intractability in theoretical physics'', Phys. Rev. Lett. 54 (1985) 735.

[13] N. Packard and S. Wolfram, ``Two-dimensional cellular automata'', J. Stat. Phys. 38 (1985) 901.

[14] S. Wolfram, ``Computer software in science and mathematics'', Sci. Amer. (September 1984).

[15] R. Sverdlove, ``Inverse problems for dynamical systems in the plane'', in Dynamical systems, A. R. Bednarek and L. Cesari (eds.), Academic Press (1977).

[16] E. Jen, ``Invariant strings and pattern-recognizing properties of one-dimensional cellular automata'', J. Stat. Phys., to be published; Los Alamos preprint LA-UR-85-2896.

[17] J. Villain, ``The random field Ising model'', in Scaling phenomena and disordered systems, NATO ASI, Geilo, Norway (April 1985).

[18] Proc. Heidelberg Colloq. on Spin Glasses, Heidelberg (June 1983); K. H. Fischer, Phys. Status Solidi 116 (1983) 357.

[19] G. Vichniac, P. Tamayo and H. Hartman, ``Annealed and quenched inhomogeneous cellular automata'', J. Stat. Phys., to be published.

[20] S. Wolfram, ``Statistical mechanics of cellular automata'', Rev. Mod. Phys. 55 (1983) 601.

[21] W. Kinzel, ``Phase transitions of cellular automata'', Z. Phys. B58 (1985) 229.

[22] T. Hogg and B. Huberman, ``Parallel computing structures capable of flexible associations and recognition of fuzzy inputs'', J. Stat. Phys. 41 (1985) 115.

[23] T. Sejnowski and C. R. Rosenberg, ``NETtalk: A parallel network that learns to read aloud'', Physica D, to be published (Johns Hopkins Elec. Eng. and Comput. Sci. Tech. Report 86-01).

[24] C. Mead and L. Conway, An introduction to VLSI systems, Addison-Wesley (1980).

[25] D. Ackley, G. Hinton and T. Sejnowski, ``A learning algorithm for Boltzmann machines'', Cognitive Sci. 9 (1985) 147.

[26] U. Frisch, B. Hasslacher and Y. Pomeau, ``A lattice gas automaton for the Navier-Stokes equation'', Los Alamos preprint LA-UR-85-3503; J. Salem and S. Wolfram, ``Thermodynamics and hydrodynamics with cellular automata'', IAS preprint (November 1985).

[27] S. Wolfram, ``Glider gun guidelines'', report distributed through Computer Recreations section of Scientific American; J. Park, K. Steiglitz and W. Thurston, ``Soliton-like behaviour in cellular automata'', Princeton University Computer Science Dept. report (1985).

[28] A. Smith, ``Simple computation-universal cellular spaces'', J. ACM 18 (1971) 331; E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning ways for your mathematical plays, Academic Press (1982).

[29] D. Hillis, The Connection Machine, MIT press (1985).

[30] S. Kauffman, ``Metabolic stability and epigenesis in randomly constructed genetic nets'', J. Theoret. Biol. 22 (1969) 437; ``Autocatalytic sets of proteins'', J. Theor. Biol. (in press).

[31] A. Gelfand and C. Walker, ``Network modelling techniques: from small scale properties to large scale systems'', University of Connecticut report (1982).

[32] E. Goles Chacc, ``Comportement dynamique de reseaux d'automates'', Grenoble University report (1985).

[33] C. Leiserson, ``Fat trees: universal networks for hardware efficient supercomputing'', IEEE Trans. Comput. C-36 (1985) 892.

[34] J. Hopcroft and J. Ullman, Introduction to automata theory, languages and computation, Addison-Wesley (1979).

[35] S. Omohundro, ``Connection Machine algorithms primer'', Thinking Machines Corporation (Cambridge, Mass.) report in preparation.

[36] A. J. Atrubin, ``A one-dimensional real-time iterative multiplier'', IEEE Trans. Comput. EC-14 (1965) 394.

[37] D. Knuth, Seminumerical algorithms, Addison-Wesley (1981).

[38] H. Nishio, ``Real time sorting of binary numbers by 1-dimensional cellular automata'', Kyoto University report (1981).

[39] T. E. Ingerson and R. L. Buvel, ``Structure in asynchronous cellular automata'', Physica 10D (1984) 59.

[40] G. Vichniac, ``Simulating physics with cellular automata'', Physica 10D (1984) 96.

[41] C. Gerald, Applied numerical analysis, Addison-Wesley (1978).

[42] M. Creutz, ``Deterministic Ising dynamics'', Ann. Phys. (in press).

[43] A. Grasselli, ``Synchronization of cellular arrays: the firing squad problem in two dimensions'', Info. & Control 28 (1975) 113.

[44] E. Domany and W. Kinzel, ``Equivalence of cellular automata to Ising models and directed percolation'', Phys. Rev. Lett. 53 (1984) 311.

[45] M. Minsky and S. Papert, Perceptrons, MIT press (1969).

[46] Z. Kohavi, Switching and finite automata theory, McGraw-Hill (1970).

[47] R. Brayton, G. Hachtel, C. McMullen and A. Sangiovanni-Vincentelli, Logic minimization algorithms for VLSI synthesis, Kluwer (1984).

[48] L. Valiant, ``Short monotone formulae for the majority function'', Harvard University report TR-01-84 (1983).

[49] M. Conrad, ``On design principles for a molecular computer'', Commun. ACM 28 (1985) 464.

[50] S. Kirkpatrick, C. Gelatt and M. Vecchi, ``Optimization by simulated annealing'', Science 220 (1983) 671.

[51] J. Hopfield and D. Tank, ``Neural computation of decisions in optimization problems'', Biol. Cybern. 52 (1985) 141.

[52] J. Holland, ``Genetic algorithms and adaptation'', Tech. Rep. #34, Univ. Michigan (1981).

[53] A. Barr and E. Feigenbaum, The handbook of artificial intelligence, HeurisTech Press (1983), vol. 1.

[54] J. Holland, ``Escaping brittleness: the possibilities of general purpose learning algorithms applied to parallel rule-based systems'', University of Michigan report.

[55] D. Lenat, ``Computer software for intelligent systems'', Scientific American (September 1984).

[56] M. Blum and S. Micali, ``How to generate cryptographically strong sequences of pseudo-random bits'', SIAM J. Comput. 13 (1984) 850.

[57] S. Kirkpatrick and G. Toulouse, ``Configuration space analysis of travelling salesman problems'', J. Physique 46 (1985) 1277.

[58] S. Kauffman, ``Self-organization, selection, adaptation and its limits: a new pattern of inference in evolution and development'', in Evolution at a crossroads, D. J. Depew and B. H. Weber (eds.), MIT press (1985).

[59] C. J. D. M. Verhagen et al., ``Progress report on pattern recognition'', Rep. Prog. Phys. 43 (1980) 785; B. Batchelor (ed.), Pattern recognition, Plenum (1978).

[60] B. Mandelbrot, The fractal geometry of nature, Freeman (1982).

[61] D. Sankoff and J. Kruskal (eds.), Time warps, string edits, and macromolecules: the theory and practice of sequence comparison, Addison-Wesley (1983).

[62] M. Minsky, Society of mind, in press.

[63] L. Valiant, ``A theory of the learnable'', Commun. ACM 27 (1984) 1134.

previous