Pages that link to "Item:Q1892212"
From MaRDI portal
The following pages link to On the computational power of neural nets (Q1892212):
Displaying 44 items.
- Analog quantum computing (AQC) and the need for time-symmetric physics (Q291575) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
- Noise-robust realization of Turing-complete cellular automata by using neural networks with pattern representation (Q418663) (← links)
- The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
- On probabilistic analog automata (Q596111) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Transiently chaotic neural networks with piecewise linear output functions (Q711939) (← links)
- Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- The nature of the extended analog computer (Q933439) (← links)
- Vapnik-Chervonenkis dimension of recurrent neural networks (Q1265745) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- A family of universal recurrent networks (Q1349875) (← links)
- Complete controllability of continuous-time recurrent neural networks (Q1391523) (← links)
- Stochastic analog networks and computational complexity (Q1578510) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- Simulation of Turing machine with uEAC-computable functions (Q1665037) (← links)
- A brief review of neural networks based learning and control and their applications for robots (Q1687400) (← links)
- Quasi-periodic \(\beta\)-expansions and cut languages (Q1704578) (← links)
- Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
- Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings (Q1980415) (← links)
- Analog neuron hierarchy (Q1982432) (← links)
- Spiking neural P systems with target indications (Q1998881) (← links)
- Spiking neural P systems with structural plasticity and anti-spikes (Q2007721) (← links)
- Synthesizing context-free grammars from recurrent neural networks (Q2044212) (← links)
- Hamilton's rule, the evolution of behavior rules and the wizardry of control theory (Q2095402) (← links)
- A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations (Q2104133) (← links)
- A statistical model of neural network learning via the Cramer-Rao lower bound (Q2132021) (← links)
- Artificial neural networks trained through deep reinforcement learning discover control strategies for active flow control (Q4628789) (← links)
- Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
- Average-Case Completeness in Tag Systems (Q5090467) (← links)
- Energy Complexity of Recurrent Neural Networks (Q5378352) (← links)
- Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors (Q5380357) (← links)
- Symbolic Computation Using Cellular Automata-Based Hyperdimensional Computing (Q5380358) (← links)
- Learning Beyond Finite Memory in Recurrent Networks of Spiking Neurons (Q5469501) (← links)
- Design of continuous-time recurrent neural networks with piecewise-linear activation function for generation of prescribed sequences of bipolar vectors (Q6057957) (← links)
- Universality of gradient descent neural network training (Q6072577) (← links)
- The Power of Machines That Control Experiments (Q6114859) (← links)
- Asynchronous spiking neural P systems with local synchronization of rules (Q6154475) (← links)
- Nonlinear spiking neural P systems with multiple channels (Q6162074) (← links)
- A provably stable neural network Turing machine with finite precision and time (Q6193467) (← links)
- Designing universal causal deep learning models: The geometric (Hyper)transformer (Q6196301) (← links)