Pages that link to "Item:Q1331940"

The following pages link to Analog computation via neural networks (Q1331940):

Displaying 50 items.

• Computation with perturbed dynamical systems (Q355515) (← links)
• The ARNN model relativises \(\mathrm{P}=\mathrm{NP}\) and \(\mathrm{P}\neq \mathrm{NP}\) (Q391177) (← links)
• On Goles' universal machines: a computational point of view (Q393156) (← links)
• The expressive power of analog recurrent neural networks on infinite input streams (Q428898) (← links)
• Finite time convergent learning law for continuous neural networks (Q470197) (← links)
• Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
• Expressive power of first-order recurrent neural networks determined by their attractor dynamics (Q736603) (← links)
• A note on discreteness and virtuality in analog computing (Q870262) (← links)
• Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
• Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
• Vapnik-Chervonenkis dimension of recurrent neural networks (Q1265745) (← links)
• Computing with truly asynchronous threshold logic networks (Q1269908) (← links)
• Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
• The structure of logarithmic advice complexity classes (Q1275000) (← links)
• Computing over the reals with addition and order (Q1338216) (← links)
• On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
• The simple dynamics of super Turing theories (Q1349873) (← links)
• A family of universal recurrent networks (Q1349875) (← links)
• The modal argument for hypercomputing minds (Q1434374) (← links)
• Hypercomputation: Philosophical issues (Q1434379) (← links)
• Quantum automata and quantum grammars (Q1566730) (← links)
• Frontier between decidability and undecidability: A survey (Q1575913) (← links)
• Stochastic analog networks and computational complexity (Q1578510) (← links)
• Analog computation with dynamical systems (Q1586961) (← links)
• A theory of complexity for continuous time systems (Q1599194) (← links)
• Simulation of Turing machine with uEAC-computable functions (Q1665037) (← links)
• Quasi-periodic \(\beta\)-expansions and cut languages (Q1704578) (← links)
• Computational capabilities of analog and evolving neural networks over infinite input streams (Q1713481) (← links)
• An optical model of computation (Q1779303) (← links)
• Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings (Q1980415) (← links)
• Analog neuron hierarchy (Q1982432) (← links)
• Subrecursive neural networks (Q2183681) (← links)
• Edge of chaos and prediction of computational performance for neural circuit models (Q2373495) (← links)
• Global exponential convergence and global convergence in finite time of non-autonomous discontinuous neural networks (Q2380608) (← links)
• Interval-valued computations and their connection with PSPACE (Q2482463) (← links)
• Generalized Lyapunov approach for convergence of neural networks with discontinuous or non-Lipschitz activations (Q2492267) (← links)
• A new Gödelian argument for hypercomputing minds based on the busy beaver problem (Q2495984) (← links)
• The case for hypercomputation (Q2497872) (← links)
• How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
• Analog computation beyond the Turing limit (Q2497879) (← links)
• The many forms of hypercomputation (Q2497883) (← links)
• THE MYTH OF 'THE MYTH OF HYPERCOMPUTATION' (Q2842654) (← links)
• The Computational Power of Interactive Recurrent Neural Networks (Q2919401) (← links)
• AN ANALOGUE-DIGITAL CHURCH-TURING THESIS (Q2929623) (← links)
• The promise of analog computation (Q2930715) (← links)
• Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics (Q2945562) (← links)
• Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q3375307) (← links)
• Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations (Q4409375) (← links)