The class of refractory neural nets

  • A. Clementi
  • M. Di Ianni
  • P. Mentrasti
Conference paper


We introduce the absolute refractory behaviour into the formal neuron model. While a probabilistic approach to such a refractory model has yet been attempted, in this paper, a deterministic analysis is realized. A first result consists in showing a not expensive algorithm to transform each refractory net into an equivalent not refractory one. Such a result is then exploited to obtain an upper bound to the computational complexity of two classical problems: the reachability and stabilization problems. They find their principal motivations in control and learning theories whenever the necessity to a priori determine the lenght of both transients and limit cycles arises. Finally, we prove that, when the connection matrices of nets are symmetric, the complementary problem of stabilization is NP-complete and reachability is P-complete.


Boolean Function Turing Machine Initial Configuration Input Gate Output Gate 
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]
    W.A. Little, “The existence of persistent states in the brain”, Mathematical Biosciences, 19, 101, 1974.MATHCrossRefGoogle Scholar
  2. [2]
    A Giordano, “Activity in neural nets with locality constraints”, Proc. of third italian conference in theoretical computer science, World scientific, Mantova (Italy), November 1989Google Scholar
  3. [3]
    W.S. McCulloch and W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys., 5, 115, 1943.MathSciNetMATHCrossRefGoogle Scholar
  4. [4]
    E.R. Caianiello, “Outline of a theory of thought-process and thinking machines”, J. of Theoretical Biology, 1, 204, 1961.MathSciNetCrossRefGoogle Scholar
  5. [5]
    E.R. Caianiello, A. de Luca and L.M. Ricciardi, “Reverberation and control of neural networks”, Kybernetik, 4, 10, 1967.CrossRefGoogle Scholar
  6. [6]
    E. Bienestock, F. Fogelman Soulie and G. Weiesbuch, (EDs), Disordered systems and biological organization, Springer-Verlag 1985.Google Scholar
  7. [7]
    P. Campadelli, “Reti di neuroni: un approccio computazionale allo studio del sistema nervoso”, PhD thesis in Computer Science, Universita’ degli Studi di Milano e Torino, 1988.Google Scholar
  8. [8]
    F. Fogelman Soulie, “Lyapunov functions and their use in automata networks”, in: E. Bienestock, F. Fogelman Soulie and G. Weiesbuch, (EDs), Disordered systems and biological organization, Springer-Verlag 1985.Google Scholar
  9. [9]
    F. Fogelman Soulie, E. Goles and G. Weiesbuch, “Transient length in sequential iteration of threshold functions”, Disc. Appl. Math., 6, 95, 1983.CrossRefGoogle Scholar
  10. [10]
    F. Fogelman Soulie, E. Goles and D. Pellegrin, “Decreasing energy functions as a tool for studying threshold networks”, Disc. Appl. Math., 12, 261, 1985.MATHCrossRefGoogle Scholar
  11. [11]
    A. Clementi and P. Mentrasti, “Cellular automata and neural networks: links and computational problems”, Proc. of third Workshop on parallel architectures and neural nets, Vietri (Italy), 1990.Google Scholar
  12. [12]
    M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman 1979.Google Scholar
  13. [13]
    L.M. Goldschager, “The monotone and planar circuit value problems are LOGSPACE-complete for P”, SIGACT News, 9, 2, 25–29, 1977.CrossRefGoogle Scholar
  14. [14]
    T. Toffoli and N. Margolus, Cellular automata machines, MIT Press, Cambridge, 1987.Google Scholar

Copyright information

© Springer-Verlag/Wien 1993

Authors and Affiliations

  • A. Clementi
    • 1
  • M. Di Ianni
    • 1
  • P. Mentrasti
    • 2
  1. 1.Dipartimento di Scienze dell’InformazioneUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Dipartimento di MatematicaUniversità di Roma “La Sapienza”RomaItaly

Personalised recommendations