Abstract
The field of Artificial Recurrent Neural Networks (ARNNs), mainly in the last two decades, was able to solve engineering problems while keeping the simplicity of the underlying principles that allow them to mimic their biological counterparts. All this attracts people from many different fields such as Neurophysiology and Computer Science. We introduce our subject from a Computer Science perspective: the ARNN is seen as a computing mechanism able to perform computation based on a program coded as a specific arrangement of neurons and synapses. This work implements a compiler and a simulator based on [4]. In [3,7,5] similar ideas are presented but they are based on higher-level languages. We start by presenting the underlying theoretical context on which this work is based. In section 2 we give a brief review of the concept of partial recursive function. In section 3 we present our approach for building neural networks from partial recursive functions. The explanation of how we adapted the design of [4] into a compiler is given in section 4. Section 5 refers to the simulator and usage examples and section 6 concludes this paper. The simulator is freely available at http://www.di.fc.ul.pt/~jpn/netdef/nwb.html.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boolos, G. and Jeffrey, R., Computability and Logic (2nd ed.), Cambridge Press, 1980.
Cutland, N., Computability–An Introduction to Recursive Function Theory, Cambridge University Press, 1980.
Gruau, F., Ratajszcza J., and Wiber, G., Fundamental study–A neural compiler, Theoretical Computer Science, Elsevier, 141, 1995, 1 - 52.
Neto, J., Siegelmann, H., Costa, J., and Araújo, C., Turing universality of neural nets (revisited), Proceedings of Computer Aided Systems Theory–EUROCAST’97, 1997.
Neto, J., Siegelmann, H., and Costa, J., Symbolic processing in neural networks, to be published at the Journal of Brasilian Computer Society, 2001.
Siegelmann, H. and Sontag, E., On the computational power of neural nets, J. of Computer and System Sciences, Academic Press, [50] 1, 1995, 132 - 150.
Siegelmann, H., On NIL: the software constructor of neural networks, Parallel Processing Letters, [6] 4, World Scientific Publ. Company, 1996, 575 - 582.
Siegelmann, H., Neural Networks and Analog Computation, Beyond the Turing Limit, Birkhäuser, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neto, J.P., Costa, J.F., Carreira, P., Rosa, M. (2004). A Compiler and Simulator for Partial Recursive Functions over Neural Networks. In: Lotfi, A., Garibaldi, J.M. (eds) Applications and Science in Soft Computing. Advances in Soft Computing, vol 24. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45240-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-45240-9_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40856-7
Online ISBN: 978-3-540-45240-9
eBook Packages: Springer Book Archive