The expressive power of analog recurrent neural networks on infinite input streams

DOI10.1016/J.TCS.2012.01.042zbMath1253.68202OpenAlexW2033372923MaRDI QIDQ428898

Jérémie Cabessa, Alessandro E. P. Villa

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.042

zbMATH Keywords

analog computationTuring machinesanalytic setstopologyBorel sets\(\omega \)-automataanalog neural networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (8)

A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion ⋮ Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics ⋮ Computational capabilities of analog and evolving neural networks over infinite input streams ⋮ Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings ⋮ Expressive power of first-order recurrent neural networks determined by their attractor dynamics ⋮ Discrete-time formulation, control, solution and verification of pendulum systems with zeroing neural dynamics ⋮ From mathematical equivalence such as Ma equivalence to generalized Zhang equivalency including gradient equivalency ⋮ A Survey on Analog Models of Computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing computability with neural nets
• \(X\)-automata on \(\omega\)-words
• Analog computation via neural networks
• Automata, logics, and infinite games. A guide to current research
• On the computational power of neural nets
• The dynamic universality of sigmoidal neural networks
• Automata Studies. (AM-34)
• Borel ranks and Wadge degrees of context free $\omega$-languages
• How We Think of Computing Today
• A Hierarchical Classification of First-Order Recurrent Neural Networks
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• Set Theory
• Interactive Computation
• On Computable Numbers, with an Application to the Entscheidungsproblem
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: The expressive power of analog recurrent neural networks on infinite input streams