The Computational Power of Interactive Recurrent Neural Networks
@article{Cabessa2012TheCP,
title={The Computational Power of Interactive Recurrent Neural Networks},
author={J{\'e}r{\'e}mie Cabessa and Hava T. Siegelmann},
journal={Neural Computation},
year={2012},
volume={24},
pages={996-1019},
url={https://api.semanticscholar.org/CorpusID:5826757}
}It is proved that interactive real-weighted neural networks can perform uncountably many more translations of information than interactive Turing machines, making them capable of super-Turing capabilities.
Topics
40 Citations
Recurrent Neural Networks and Super-Turing Interactive Computation
- 2015
Computer Science, Biology
The results show that the computational powers of neural nets involved in a classical or in an interactive computational framework follow similar patterns of characterization, and suggest that some intrinsic computational capabilities of the brain might lie beyond the scope of Turing-equivalent models of computation.
The Super-Turing Computational Power of Interactive Evolving Recurrent Neural Networks
- 2013
Computer Science
It is proved that the so-called interactive evolving recurrent neural networks are computationally equivalent to interactive Turing machines with advice, hence capable of super-Turing potentialities and a precise characterisation of the ω-translations realised by these networks.
Interactive Evolving Recurrent Neural Networks Are Super-turing
- 2012
Computer Science
This work shows that interactive evolving recurrent neural networks are not only super-Turing, but also capable of simulating any other possible interactive deterministic system, irrespective of whether their synaptic weights are rational or real.
Recurrent Neural Networks - A Natural Model of Computation beyond the Turing Limits
- 2012
Computer Science, Philosophy
It is shown that recurrent neural networks provide a suitable and natural model of computation beyond the Turing limits, and doesn’t draw any hasty conclusion about the controversial issue of a possible predominance of biological intelligence over the potentialities of artificial intelligence.
On Super-Turing Neural Computation
- 2015
Computer Science
A historical survey of the most significant results concerning the computational power of neural models, and the recent results by Cabessa, Siegelmann and Villa revealing the super-Turing computational potentialities of interactive and evolving recurrent neural networks.
Computational capabilities of recurrent neural networks based on their attractor dynamics
- 2015
Computer Science
It is shown that rational-weighted neural networks are computationally equivalent to deterministic Muller Turing machines, whereas all other models of real- Weighted or evolving neural Networks are equivalent to each other, and strictly more powerful than deterministic Müller Turing machines.
Expressive power of first-order recurrent neural networks determined by their attractor dynamics
- 2016
Computer Science, Mathematics
The Super-Turing Computational Power of plastic Recurrent Neural Networks
- 2014
Computer Science
The results support the claim that the general mechanism of plasticity is crucially involved in the computational and dynamical capabilities of biological neural networks and show that the super-Turing level of computation reflects in a suitable way the capabilities of brain-like models of computation.
Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics
- 2015
Computer Science, Mathematics
It is proved that the two models of rational-weighted and real- Weighted nondeterministic hybrid neural networks are computationally equivalent, and recognize precisely the set of all analytic neural \(\omega \)-languages.
Computational capabilities of analog and evolving neural networks over infinite input streams
- 2019
Computer Science, Mathematics
25 References
Analog computation via neural networks
- 1993
Computer Science, Engineering
The authors pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research, which exhibit at least some robustness with respect to noise and implementation errors.
On the computational power of neural nets
- 1992
Computer Science, Mathematics
It is proved that one may simulate all Turing Machines by rational nets in linear time, and there is a net made up of about 1,000 processors which computes a universal partial-recursive function.
The Dynamic Universality of Sigmoidal Neural Networks
- 1996
Computer Science, Mathematics
The techniques can be applied to a much more general class of “sigmoidal-like” activation functions, suggesting that Turing universality is a relatively common property of recurrent neural network models.
Turing on Super-Turing and adaptivity.
- 2013
Biology, Philosophy
Beyond the Turing Limit: Evolving Interactive Systems
- 2001
Computer Science
It is argued that ITM's with advice can serve as an adequate reference model for capturing the essence of computations by evolving interactive systems, showing that 'in theory' the latter are provably more powerful than classical systems.
How We Think of Computing Today
- 2008
Computer Science, Philosophy
Two models inspired from key mechanisms of current systems in both artificial and natural environments are proposed: evolving automata and interactive Turing machines with advice, which are shown to be equivalent and both are provably computationally more powerful than the models covered by the old computing paradigm.
Persistent Turing Machines as a Model of Interactive Computation
- 2000
Computer Science
The methods and tools for formalizing PTM computation developed in this paper can serve as a basis for a more comprehensive theory of interactive computation.
The Turing machine paradigm in contemporary computing
- 2001
Computer Science, Mathematics
The work of Hartmanis, Stearns, Karp, Cook and others showed that the refinement of the theory to resource-bounded computations gave the means to explain the many intuitions concerning the complexity or ‘hardness’ of algorithmic problems in a precise and rigorous framework.