Pages that link to "Item:Q1190653"
From MaRDI portal
The following pages link to Turing computability with neural nets (Q1190653):
Displayed 15 items.
- A neural compiler (Q673775) (← links)
- Universal computation and other capabilities of hybrid and continuous dynamical systems (Q673870) (← links)
- Transiently chaotic neural networks with piecewise linear output functions (Q711939) (← links)
- A learning result for continuous-time recurrent neural networks (Q1274412) (← links)
- Computability with low-dimensional dynamical systems (Q1334658) (← links)
- The simple dynamics of super Turing theories (Q1349873) (← links)
- A family of universal recurrent networks (Q1349875) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- Stochastic analog networks and computational complexity (Q1578510) (← links)
- Chaos in computer performance (Q3529636) (← links)
- Training Recurrent Networks by Evolino (Q3591517) (← links)
- ON COMPUTATION OVER CHAOS USING NEURAL NETWORKS: APPLICATION TO BLIND SEARCH AND RANDOM NUMBER GENERATION (Q5484835) (← links)
- A Solution Method for Truncated Normalized Max Product Fuzzy Set of Equations (Q5697011) (← links)
- Analysis and Design of Echo State Networks (Q5758069) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)