A theory of complexity for continuous time systems
From MaRDI portal
Publication:1599194
DOI10.1006/jcom.2001.0581zbMath1004.68072OpenAlexW2057137378WikidataQ58455280 ScholiaQ58455280MaRDI QIDQ1599194
Shmuel Fishman, Hava T. Siegelmann, Asa Ben-Hur
Publication date: 5 June 2002
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.2001.0581
Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Random matrix theory for the analysis of the performance of an analog computer: a scaling theory, General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, Scaling and universality of the complexity of analog computation, Exponential transients in continuous-time Liapunov systems., Probabilistic analysis of a differential equation for linear programming, Computational complexity of dynamical systems: the case of cellular automata, Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer, A universal scaling theory for complexity of analog computation, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, Analog computation with dynamical systems, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, A Survey on Analog Models of Computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic analysis of a differential equation for linear programming
- Real functions, contraction mappings, and P-completeness
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- ``Neural computation of decisions in optimization problems
- The maximum flow problem is log space complete for P
- Hamiltonian structure of dynamical systems which solve linear programming problems
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
- On the computability of fractal dimensions and Hausdorff measure
- Analog computation via neural networks
- Computability with low-dimensional dynamical systems
- Recursion theory on the reals and continuous-time computation
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Analog computation with dynamical systems
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Some Remarks on the Foundations of Numerical Analysis
- Finding the maximum, merging, and sorting in a parallel computation model
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Dynamical Systems which Solve Optimization Problems with Linear Constraints
- Prevalence: a translation-invariant “almost every” on infinite-dimensional spaces
- Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
- Unpredictability and undecidability in dynamical systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Computational Complexity of Two-Dimensional Regions
- Mathematical Theory of the Differential Analyzer
- Iteration, inequalities, and differentiability in analog computers
