Pages that link to "Item:Q1599194"
From MaRDI portal
The following pages link to A theory of complexity for continuous time systems (Q1599194):
Displaying 12 items.
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- A universal scaling theory for complexity of analog computation (Q716028) (← links)
- Computational complexity of dynamical systems: the case of cellular automata (Q948080) (← links)
- Exponential transients in continuous-time Liapunov systems. (Q1426460) (← links)
- Analog computation with dynamical systems (Q1586961) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q3375307) (← links)
- Scaling and universality of the complexity of analog computation (Q3531580) (← links)
- Continuous-Time Symmetric Hopfield Nets Are Computationally Universal (Q4816928) (← links)
- General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results (Q4819851) (← links)
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer (Q4922124) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
