Lower bounds of computational power of a synaptic calculus
- João Pedro NetoAffiliated withDept. Informática, Faculdade de Ciências da Universidade de Lisboa
- , J. Félix CostaAffiliated withDept. Informática, Faculdade de Ciências da Universidade de Lisboa
- , Helder CoelhoAffiliated withDept. Informática, Faculdade de Ciências da Universidade de Lisboa
The majority of neural net models presented in the literature focus mainly in the neural structure of nets, leaving aside many details about synapses and dendrites. This can be very reductionist if we want to approach our model to real neural nets. These structures tend to be very elaborate, and are able to process information in very complex ways (see [MEL 94] for details).
We will introduce a new model, the S-Net (Synaptic-Net), in order to represent neural nets with special emphasis on synaptic and dendritic transmission. First, we present the supporting mathematical structure of S-Nets, initially inspired on Petri-Net formalism, adding a transition to transition connection type. There are two main components of S-Nets, neurones and synaptic/dendritic units (s/d units). All activation values are integers. Neurones are similar to McCulloch-Pitts neurones, and s/d units will process information within certain class of functions.
S-Nets are able to represent spatial nets representations in a very natural way. We can easily modulate the length of an axon, the connection or branching of two dendrites or synaptic connections. Some examples are shown.
Next, the focus will be on what kind of functions are suited to s/d units. We will present three function types: sum, maximization and simple negation (changing an excitatory impulse to an inhibitory one, or vice-versa). With these functions for s/d units and with simple neurones, we will prove that all recursive functions can be computed by at least one specific S-Net. In order to achieve this, we will use the Register Machine, and show a way to build for each symbolic program, a S-Net capable of computing the function defined for that specific program. It is shown a simple application example. This computational power will be achieved without any use of synaptic weights (i.e., all weights are one as in McCulloch's model) or neurones activation values (i.e., all values are set to zero).
Finally, some aspects for future investigation are presented, namely, the possibility of synaptic-synaptic connections, how can noise be handled, and some other features intended to approach this mathematical model to our reality.
KeywordsNeural Networks Synapses Dentritic Trees Neural Computation Computational Theory Spatial Representation
- Lower bounds of computational power of a synaptic calculus
- Book Title
- Biological and Artificial Computation: From Neuroscience to Technology
- Book Subtitle
- International Work-Conference on Artificial and Natural Neural Networks, IWANN'97 Lanzarote, Canary Islands, Spain, June 4–6, 1997 Proceedings
- pp 340-348
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Additional Links
- Neural Networks
- Dentritic Trees
- Neural Computation
- Computational Theory
- Spatial Representation
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.