Analog computation with dynamical systems

DOI10.1016/S0167-2789(98)00057-8zbMath0954.37038OpenAlexW2108365750MaRDI QIDQ1586961

Hava T. Siegelmann, Shmuel Fishman

Publication date: 21 November 2000

Published in: Physica D (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-2789(98)00057-8

zbMATH Keywords

dissipative dynamical systemscontinuous time flowscomplexity of chaotic attractorscomputational complexity for continuous time systemscontinuous Hopfield networknatural processesspecial purpose analog computers

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Approximation methods and numerical treatment of dynamical systems (37M99) Numerical problems in dynamical systems (65P99)

Related Items

An analog characterization of the Grzegorczyk hierarchy, Chaotic and stochastic phenomena in systems with non-invertible nonlinearities, Infinite traces and symbolic dynamics, Random matrix theory for the analysis of the performance of an analog computer: a scaling theory, A dynamical model of parallel computation on bi-infinite time-scale, Autonomous choices among deterministic evolution-laws as source of uncertainty, Controlling the global behavior of coupled chaotic systems by means of energy regulation., Scaling and universality of the complexity of analog computation, Probabilistic analysis of a differential equation for linear programming, Analog-symbolic memory that tracks via reconsolidation, Analog computation through high-dimensional physical chaotic neuro-dynamics, Iteration, inequalities, and differentiability in analog computers, The case for hypercomputation, A new conceptual framework for analog computation, A theory of complexity for continuous time systems, From exactly solvable chaotic maps to stochastic dynamics

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
• Universal computation and other capabilities of hybrid and continuous dynamical systems
• Hybrid systems
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• ``Neural computation of decisions in optimization problems
• Fractal basin boundaries
• Dynamical recognizers: real-time language recognition by analog computers
• Hamiltonian structure of dynamical systems which solve linear programming problems
• Analytic study of the memory storage capacity of a neural network
• Occurrence of strange Axiom A attractors near quasi periodic flows on \(T^m\), \(m\geq 3\)
• Analog computation via neural networks
• The transition to chaotic attractors with riddled basins
• Recursion theory on the reals and continuous-time computation
• A theory of complexity for continuous time systems
• The extended analog computer
• Quantitative universality for a class of nonlinear transformations
• On the computational power of neural nets
• A logical DES approach to the design of hybrid control systems
• The existence of persistent states in the brain
• On the nature of turbulence
• A simple neural network generating an interactive memory
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• Stable and Random Motions in Dynamical Systems
• Fractal measures and their singularities: The characterization of strange sets
• Differential automata and their discrete simulators
• A universal differential equation
• 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)
• The structure of basins of attraction and their trapping regions
• RIDDLED BASINS
• DETERMINATION OF CRISIS PARAMETER VALUES BY DIRECT OBSERVATION OF MANIFOLD TANGENCIES
• From attractor to chaotic saddle: a tale of transverse instability
• Logarithmic Sobolev inequalities and the growth of 𝐿^{𝑝} norms
• Unpredictability and undecidability in dynamical systems
• Scaling behavior of chaotic systems with riddled basins
• On some relations between dynamical systems and transition systems
• Prevalence. An addendum to: “Prevalence: a translation-invariant ‘almost every’ on infinite-dimensional spaces” [Bull. Amer. Math. Soc. (N.S.) 27 (1992), no. 2, 217–238; MR1161274 (93k:28018)]
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Digital simulation of analog computation and Church's thesis
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.
• SMALL DENOMINATORS AND PROBLEMS OF STABILITY OF MOTION IN CLASSICAL AND CELESTIAL MECHANICS
• Simple Computation-Universal Cellular Spaces
• Correlation Matrix Memories
• Mathematical Theory of the Differential Analyzer