Computational capabilities of analog and evolving neural networks over infinite input streams
type: Item
instance of: scholarly article
title: Computational capabilities of analog and evolving neural networks over infinite input streams
zbMATH Open document ID: 1410.68120
author: Jérémie Cabessa
author: Olivier Finkel
published in: Journal of Computer and System Sciences
publication date: 2019-01-25T00:00:00Z
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 92B20
zbMATH DE Number: 7006825
zbMATH Keywords: recurrent neural networks
zbMATH Keywords: analog computation
zbMATH Keywords: infinite computation
zbMATH Keywords: attractors
zbMATH Keywords: Turing machines
zbMATH Keywords: Turing machines with oracles
zbMATH Keywords: super-Turing
zbMATH Keywords: \(\omega\)-languages
zbMATH Keywords: Borel sets
zbMATH Keywords: analytic sets
MaRDI profile type: Publication
full work available at URL: j.jcss.2018.11.003
OpenAlex ID: W2900895583
cites work: Q5665186
cites work: Computational power of neural networks: a characterization in terms of Kolmogorov complexity
cites work: Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics
cites work: Expressive power of evolving neural networks working on infinite input streams
cites work: The computational power of interactive recurrent neural networks
cites work: A Hierarchical Classification of First-Order Recurrent Neural Networks
cites work: The expressive power of analog recurrent neural networks on infinite input streams
cites work: Recurrent Neural Networks and Super-Turing Interactive Computation
cites work: Expressive power of first-order recurrent neural networks determined by their attractor dynamics
cites work: A Unified Approach to Building and Controlling Spiking Attractor Networks
cites work: Ambiguity of \(\omega \)-languages of Turing machines
cites work: Neural networks and physical systems with emergent collective computational abilities.
cites work: Neurons with graded response have collective computational properties like those of two-state neurons.
cites work: Q5452298
cites work: Q4323294
cites work: The dynamic universality of sigmoidal neural networks
cites work: The existence of persistent states in the brain
cites work: Analytic study of the memory storage capacity of a neural network
cites work: A logical calculus of the ideas immanent in nervous activity
cites work: Q5590814
cites work: Q5322161
cites work: Q5317419
cites work: Spike timing dependent synaptic plasticity in biological systems
cites work: Q4231133
cites work: Q4805386
cites work: Analog computation via neural networks
cites work: On the computational power of neural nets
cites work: General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
cites work: Q4385530
cites work: Q5624687
Wikidata QID: Q128881315
DOI: 10.1016/J.JCSS.2018.11.003
description: scientific article; zbMATH DE number 7006825