Merging Sub-symbolic and Symbolic Computation (2008)
João Pedro Neto, J. Félix Costa, Ademar Ferreira
Abstract. In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational...
INFORMATION CODING AND NEURAL COMPUTING (2008)
J. Pedro Neto, Hava T. Siegelmann, J. Félix Costa
Abstract. In [2,5] it is showed that programming languages can be translated into recurrent neural nets. Implementation of programming languages in neural nets turns to be not only theoretical...
Symbolic Processing in Neural Networks (2008)
João Pedro, Neto Hava, T. Siegelmann, J. Félix Costa
Abstract. In this paper we show that programming languages can be translated on recurrent (analog, rational weighted) neural nets. Implementation of programming languages in neural nets turns to be...
Merging Sub-symbolic and Symbolic Computation (2007)
João Pedro Neto, J. Félix Costa, Ademar Ferreira
Abstract. In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational...
Turing Universality of Neural Nets (Revisited) (2007)
J. Pedro Neto, Hava T. Siegelmann, J. Félix Costa
. We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. We emphasize the...
Merging Sub-symbolic and Symbolic Computation (2007)
João Pedro Neto, J. Félix Costa, Ademar Ferreira
. In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational weighted)...
Verifying Properties of Neural Networks (2007)
Pedro Rodrigues, J. Félix Costa, Hava T. Siegelmann
Abstract. In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation. She also...
Canonical Institutions of Behaviour (2007)
Abstract. The concept of behaviour plays a central role in the specification of a considerable number of different kinds of systems. In these settings a “behaviour ” is seen as a possible...
Symbolic processing in neural networks (2003)
Neto,João Pedro, Siegelmann,Hava T., Costa,J.Félix
In this paper we show that programming languages can be translated into recurrent (analog, rational weighted) neural nets. Implementation of programming languages in neural nets turns to be not only...
Symbolic processing in neural networks (2003)
João Pedro Neto, Hava T. Siegelmann, J. Félix Costa
Abstract. In this paper we show that programming languages can be translated into recurrent (analog, rational weighted) neural nets. Implementation of programming languages in neural nets turns to be...
Building Neural Net Software (1999)
João Pedro Neto, José Félix Costa, J. Pedro Neto, J. Félix Costa
Alternatively, reports are available by post from the above address.
Turing Universality of Neural Nets (revisited (1997)
J. Pedro Neto, Hava T. Siegelmann, J. Félix Costa
Abstract. We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. We...
Refinement in a Concurrent, Object-Based Language (1996)
P. Blauth Menezes, A. Sernadas, J. Félix Costa
Nonsequential automata constitute a categorial semantic domain based on labeled transition system with full concurrency, where restriction and relabeling are functorial and a class of morphisms...