Neural nets and cellular automata

  • E. R. Caianiello
  • M. Marinaro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 253)


Boolean Function Cellular Automaton Transient State Permutation Matrix Combination Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1).
    Wolfram, S., Statistical Mechanics of Cellular Automata. Rev. Mod. Phys. 55 (1983) 601.Google Scholar
  2. 2).
    A collection of several papers on cellular automata can be found in Physica 10D (1984) 1–248.Google Scholar
  3. 3).
    Caianiello, E.R., Outline of a theory of thought processes and thinking machines. J. Theor. Biol. 2, 204 (1961); with W.E.L. Grimson, Synthesis of Boolean Nets and Time Behaviour of a General Mathematical Neuron. Biol. Cybernetics 18, 111 (1975).Google Scholar
  4. 4).
    Dertouzos, M.G., "Theoretical logic: a synthesis approach" MIT Thesis (1965); E.R. Caianiello, Some Remarks on the Tensorial Linearization of General and Linearly Separable Boolean Functions. Kybernetic 12, 90 (1973).Google Scholar
  5. 5).
    Wolfram, S., University and Complexity in Cellular Automata. Physica 10D (1984) 1Google Scholar
  6. 6).
    Marin, O., Odlyzko, A.M., Wolframs, S., Algebraic Properties of Cellular Automata. Com. Math. Phys. 93 (1984) 219.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • E. R. Caianiello
    • 1
  • M. Marinaro
    • 1
    • 2
  1. 1.Dipartimento di Fisica Teorica e sue Metodologie per le Scienze ApplicateUniversità di SalernoItalia
  2. 2.Unità G.N.S.M.Università di SalernoItalia

Personalised recommendations