Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
W.A. Little, “The existence of persistent states in the brain”, Mathematical Biosciences, 19, 101, 1974.
A Giordano, “Activity in neural nets with locality constraints”, Proc. of third italian conference in theoretical computer science, World scientific, Mantova (Italy), November 1989
W.S. McCulloch and W. Pitts, A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys., 5, 115, 1943.
E.R. Caianiello, “Outline of a theory of thought-process and thinking machines”, J. of Theoretical Biology, 1, 204, 1961.
E.R. Caianiello, A. de Luca and L.M. Ricciardi, “Reverberation and control of neural networks”, Kybernetik, 4, 10, 1967.
E. Bienestock, F. Fogelman Soulie and G. Weiesbuch, (EDs), Disordered systems and biological organization, Springer-Verlag 1985.
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.
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.
F. Fogelman Soulie, E. Goles and G. Weiesbuch, “Transient length in sequential iteration of threshold functions”, Disc. Appl. Math., 6, 95, 1983.
F. Fogelman Soulie, E. Goles and D. Pellegrin, “Decreasing energy functions as a tool for studying threshold networks”, Disc. Appl. Math., 12, 261, 1985.
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.
M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman 1979.
L.M. Goldschager, “The monotone and planar circuit value problems are LOGSPACE-complete for P”, SIGACT News, 9, 2, 25–29, 1977.
T. Toffoli and N. Margolus, Cellular automata machines, MIT Press, Cambridge, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag/Wien
About this paper
Cite this paper
Clementi, A., Di Ianni, M., Mentrasti, P. (1993). The class of refractory neural nets. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7533-0_2
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82459-7
Online ISBN: 978-3-7091-7533-0
eBook Packages: Springer Book Archive