A theory of complexity for continuous time systems

Journal of Complexity

Volumn 18, Issue 1, 2002, Pages 51-86

  Ben Hur, Asa ^a   Siegelmann, Hava T ^b   Fishman, Shmuel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamical systems; Theory of analog computation

Indexed keywords

EID: 0036222192     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.2001.0581     Document Type: Article

References (54)

1. "Introduction to the Theory of Neural Computation"
2. "Neural Networks for Optimization and Signal Processing"
3. A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constrants
4. "Analog VLSI and Neural Systems"
5. "Vision Chips: Implementation of Vision Algorithms with Analog VLSI Circuits"
6. Winner-take-all networks with lateral excitation
7. "Optimization and Dynamical Systems"
8. "Computational Complexity"
9. "Chaos in Dynamical Systems"
10. On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines
11. "Complexity and Real Computation"
12. "Collected Works"
13. Unpredictability and undecidability in dynamical systems
14. Computability with low-dimensional dynamical systems
15. Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
16. Hybrid models for motion control systems
17. Analog computation with continuous ODEs
18. Reachability analysis of dynamical systems with piecewise-constant derivatives
19. A survey of continuous time computation theory
20. Mathematical theory of the differential analyzer
21. Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers)
22. Iteration, inequalities and differentiability in analog computers
23. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
24. Recursion theory on the reals and continuous-time computation
25. Neural computation of decisions in optimization problems
26. A continuous-time hopfield net simulation of discrete neural networks
27. Dynamical systems that sort lists, diagonalize matrices and solve linear programming problems
28. Hamiltonian structure of dynamical systems which solve linear programming problems
29. Quantum mechanical computers
30. Analog computation via neural networks
31. Computation beyond the Turing limit
32. Computational complexity for continuous time dynamics
33. "Differential Equations, Dynamical Systems and Linear Algebra"
34. "Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields"
35. Terminal attractors in neural networks
36. Prevalence: A translational-invariant "almost every" on infinite dimensional spaces
37. Real functions, contraction mappings and P-completeness
38. Dynamical systems which solve optimization problems with linear constraints
39. Computation by dynamical systems
40. Finding the maximum, merging and sorting in a parallel computation model
41. Some remarks on the foundations of numerical analysis
42. Approximate solutions of numerical problems, condition number analysis and condition number theorem
43. Incorporating condition measures into the complexity theory of linear programming
44. "The Theory of Matrices"
45. The complexity of solving linear programming with a differential equation
46. "Combinatorial Optimization"
47. "Integer and Combinatorial Optimization"
48. "Linear Programming and Network Flows"
49. "Primal-Dual Interior-Point Methods"
50. "Linear Programming"
51. Parallel algorithms for network flow problems
52. The maximum flow problem is log space complete for P
53. Computational complexity of two-dimensional regions
54. On the computability of fractal dimensions and Housdorff measure