Advertisement

Boolean Systems, Adaptive Automata, Evolution

  • Stuart A. Kauffman
Conference paper
Part of the NATO ASI Series book series (volume 20)

Abstract

The past decade has seen renewed interest in non Von Neuman computation by parallel processing systems. This interest on the part of solid state physicists and others has led to models of pattern recognition and associative memory (1,2,3). In these models, it is largely the dynamical attractors which are of interest as the classes, or memories, stored in the systems. Further, the mathematical tractability of threshold systems with symmetric coupling, that is, in which each binary device “fires” if a weighted sum of excitation minus inhibition exceeds some threshold, and couplings between two binary devices are symmetrical, has focused particular attention on this subclass of automata. The marked advantage of this subclass of automata is the existence of a potential function allowing prescription of weightings on inputs to each binary device in order to choose steady state attractors with desired properties such as location in state space, and stability to perturbation (1,2,3).

Keywords

Boolean Function Cellular Automaton Cycle Length Binary Device State Cycle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. (1).
    Hopfield, J.J. PNAS 79:2554 (1982)MathSciNetCrossRefGoogle Scholar
  2. (2).
    Hinton, G.E. and T.J. Sejnowski. Proc. of IEEE Conf. on comp. vis. and patt. recog., pp. 448–453 (1983).Google Scholar
  3. (3).
    Fogelman-Soulié, F. Contribution à une Théorie du calcul sur réseaux. Thèse de l’Université Scientifique et Médicale de Grenoble (1985).Google Scholar
  4. (4).
    Wolfram, S. Rev. of Modem Phvsics 55. 601–644 (1983)zbMATHMathSciNetCrossRefGoogle Scholar
  5. (6).
    Rubin, H. and R. Sitgreave. Tech. Report No.l9A (Appl. Math, and Stats Lab, Stanford University (1954).Google Scholar
  6. (6) Kauffman, S.A.  J. Theor. Biol. 22:437–467 (1969)Google Scholar
  7. (7).
    Gelfand, A.E. and C.C. Walker. Ensemble Modeling. New York: Marcel Dekker Inc. (1984).zbMATHGoogle Scholar
  8. (8).
    Gelfand, A.E. and C.C. Walker. Bull. Math. Biol. 44:309 320 (1982).Google Scholar
  9. (9).
    Coste, J. Personal communication (1985)Google Scholar
  10. (10).
    Anderson, P.W. PNAS 80:3386 (1983)CrossRefGoogle Scholar
  11. (11).
    Walker, C.C. Tech. Report 5, AF Grant 7–64, Electrical Engineering Research Laboratory, University of Illinois, Urbana (1965).Google Scholar
  12. (12).
    Walker C.C. Journal of Cybernetics 1:55–67 (1971).CrossRefGoogle Scholar
  13. (13).
    Walker, C.C. Prog. in Cybernetics and Systems Research Washington, C.C.: Hemisphere, pp.43–47 (1978).Google Scholar
  14. (13).
    Holland, J.H. Journal of the Franklin Institute 270: 202–226 (1960).zbMATHMathSciNetCrossRefGoogle Scholar
  15. (15).
    Kauffman, S.A. Journal of Cybernetics 1:71–96 (1971).CrossRefGoogle Scholar
  16. (16).
    Kauffman, S.A. J. Theor. Biol. 22:437–467 (1969).MathSciNetCrossRefGoogle Scholar
  17. (17).
    Kauffman, S.A. Mathematics in the Life Sciences 3:63–116 (1970).Google Scholar
  18. (18).
    Kauffman, S.A. J. Theor. Biol. 44:167–190 (1974).CrossRefGoogle Scholar
  19. (19).
    Kauffman, S.A. Physica 10D: 145–156 (1984).MathSciNetGoogle Scholar
  20. (20).
    Babcock, A.K. Doctoral Disseration, State University of New York, Buffalo (1976).Google Scholar
  21. (21).
    Atlan, H., Fogelman-Soulié, F., Salomon, J. and Weisbuch, G. Journal of Cybernetics and Systems. 12, 103–131 (1981).CrossRefGoogle Scholar
  22. (22).
    Cull, P. Kybernetik 8:31–39 (1971).zbMATHCrossRefGoogle Scholar
  23. (23).
    Aleksander, I. Int. J. Man/Machine Studies 5:115 (1973).CrossRefGoogle Scholar
  24. (24).
    Sherlock, R.A. Bull. Math. Biol. 41:687 (1979).zbMATHMathSciNetGoogle Scholar
  25. (25).
    Sherlock, R.A. Bull. Math. Biol. 41:707 (1979).zbMATHMathSciNetGoogle Scholar
  26. (26).
    Fogelman-Soulié, F., 27–45, in Dynamical Systems and Cellular automata, edited by Demongeot J., Golès E. and Tchuente M., Academic Press, New York (1985).Google Scholar
  27. (27).
    Fogelman-Soulié, F. Disc. Appl.Math. 9, 139–156, (1984).zbMATHCrossRefGoogle Scholar
  28. (28).
    Erdos, P. and A. Renyui. On the Random Graphs 1, Vol.6 Inst. Math. Univ. De Breceniens (1959).Google Scholar
  29. (29).
    Erdos, P. and A. Renyi. On the Evolution of Random Graphs publ. 5. Math. Inst. Hungarian Acad. Sci. (1960).Google Scholar
  30. (30).
    Berge, C. The Theory of Graphs and Its Applications. London: Methusena (1962).zbMATHGoogle Scholar
  31. (31).
    Kauffman, S.A., 221–234, in Dynamical Systems and Cellular automata, edited by Demongeot J., Golès E. and Tchuente M., Academic Press, New York (1985).Google Scholar
  32. (32).
    Ewens, W.J. Mathematical Population Genetics. Berlin, Heidelberg, New York: Springer Verlag (1979).zbMATHGoogle Scholar
  33. (33).
    Kauffman, S.A. In press, in Biology and the New Philosophy of Science. Fullerton: Univ. Calif. Press (1985).Google Scholar
  34. (34).
    Weisbuch, G. In C.R. Acad. Sc. 298, 375–378, (1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Stuart A. Kauffman
    • 1
  1. 1.Department of Biochemistry and BiophysicsUniversity of Pennsylvania School of MedicinePennsylvaniaUSA

Personalised recommendations