Analog computation via neural networks
From MaRDI portal
Publication:1331940
DOI10.1016/0304-3975(94)90178-3zbMath0822.68029WikidataQ55897750 ScholiaQ55897750MaRDI QIDQ1331940
Eduardo D. Sontag, Hava T. Siegelmann
Publication date: 18 October 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90178-3
Related Items
Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations, On digital nondeterminism, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, A refutation of Penrose's Gödelian case against artificial intelligence, Recurrent Neural Networks with Small Weights Implement Definite Memory Machines, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Iteration, inequalities, and differentiability in analog computers, A survey of computational complexity results in systems and control, The stability of saturated linear dynamical systems is undecidable, Automata theory based on quantum logic: Some characterizations, A weak version of the Blum, Shub, and Smale model, On the computation of Boolean functions by analog circuits of bounded fan-in, A note on discreteness and virtuality in analog computing, Analog computation through high-dimensional physical chaotic neuro-dynamics, Dynamical recognizers: real-time language recognition by analog computers, Vapnik-Chervonenkis dimension of recurrent neural networks, Computing with truly asynchronous threshold logic networks, Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, The structure of logarithmic advice complexity classes, Computing over the reals with addition and order, On the computational power of dynamical systems and hybrid systems, The simple dynamics of super Turing theories, A family of universal recurrent networks, The modal argument for hypercomputing minds, Hypercomputation: Philosophical issues, Quantum automata and quantum grammars, Frontier between decidability and undecidability: A survey, Stochastic analog networks and computational complexity, Analog computation with dynamical systems, A theory of complexity for continuous time systems, An optical model of computation, Edge of chaos and prediction of computational performance for neural circuit models, Global exponential convergence and global convergence in finite time of non-autonomous discontinuous neural networks, Interval-valued computations and their connection with PSPACE, Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations, A new Gödelian argument for hypercomputing minds based on the busy beaver problem, The case for hypercomputation, How much can analog and hybrid systems be proved (super-)Turing, Analog computation beyond the Turing limit, The many forms of hypercomputation, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
Cites Work
- Turing machines that take advice
- The complexity of analog computation
- The promise of analog computation
- Constant Depth Reducibility
- On connectionist models
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
