Computational Complexity for Continuous Time Dynamics
TL;DR: A framework for an algorithmic analysis of dissipative flows is presented, enabling the comparison of the performance of discrete and continuous time analog computation models.
read more
Abstract: Dissipative flows model a large variety of physical systems. In this Letter the evolution of such systems is interpreted as a process of computation; the attractor of the dynamics represents the output. A framework for an algorithmic analysis of dissipative flows is presented, enabling the comparison of the performance of discrete and continuous time analog computation models. A simple algorithm for finding the maximum of n numbers is analyzed, and shown to be highly efficient. The notion of tractable (polynomial) computation in the Turing model is conjectured to correspond to computation with tractable (analytically solvable) dynamical systems having polynomial complexity. The computation of a digital computer, and its mathematical abstraction, the Turing machine is described by a map on a discrete configuration space. In recent years scientists have developed new approaches to computation, some of them based on continuous time analog systems. The most promising are neuromorphic systems [1], models of human memory [2], and experimentally realizable quantum computers [3]. Although continuous time systems are widespread in experimental realizations, no theory exists for their algorithmic analysis. The standard theory of computation and computational complexity [4] deals with computation in discrete time and in a discrete configuration space, and is inadequate for the description of such systems. This Letter describes an attempt to fill this gap. Our model of a computer is based on dissipa
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Quantum control landscapes
Raj Chakrabarti,Herschel Rabitz +1 more
TL;DR: Here, studies that aim to systematically characterize properties of the solution sets to quantum control problems that are fundamentally different from their classical counterparts are reviewed, enabling the classification of quantum control mechanisms and the design of globally efficient quantum control algorithms.
153
Quantum Control Landscapes
Raj Chakrabarti,Herschel Rabitz +1 more
TL;DR: In this paper, the authors review studies that aim to systematically characterize these properties, enabling the classification of quantum control mechanisms and the design of globally efficient quantum control algorithms, and show that this simplicity originates in universal properties of the solution sets to quantum control problems that are fundamentally different from their classical counterparts.
144
Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines
TL;DR: It is proved mathematically that periodic orbits and strange attractors cannot coexist with equilibria, and the implications of the DMM realization through SOLCs to the NP = P question related to constraints of poly-resources resolvability are discussed.
118
Computability with polynomial differential equations
TL;DR: It is shown that there are initial value problems defined with polynomial ordinary differential equations that can simulate universal Turing machines in the presence of bounded noise.
86
Integral biomathics: a post-Newtonian view into the logos of bios.
TL;DR: This paper provides a critical review of the major assumptions which guide the development of modern computer science and engineering towards emulating biological systems and explores the potential and the virtues of biology to reshape contemporary science.
References
Neural computation of decisions in optimization problems
John J. Hopfield,David W. Tank +1 more
TL;DR: Results of computer simulations of a network designed to solve a difficult but well-defined optimization problem-the Traveling-Salesman Problem-are presented and used to illustrate the computational power of the networks.
6K
Chaos in dynamical systems
Edward Ott
- 01 Jan 1993
TL;DR: In the new edition of this classic textbook, the most important change is the addition of a completely new chapter on control and synchronization of chaos as discussed by the authors, which will be of interest to advanced undergraduates and graduate students in science, engineering and mathematics taking courses in chaotic dynamics, as well as to researchers in the subject.
3.4K
Chaos in Dynamical Systems
Daniel Zwillinger
- 01 Jan 1992
TL;DR: In this article, the authors focus on chaos in dynamical systems and highlight that Lyapunov exponents are a measure of the rate of divergence (or convergence) of initially infinitesimally separated trajectories.
1.8K
•Book
Analog VLSI implementation of neural systems
Carver A. Mead,Mohammed Ismail +1 more
- 13 Oct 2011
TL;DR: A Neural Processor for Maze Solving and Issues in Analog VLSI and MOS Techniques for Neural Computing are discussed.
1.6K
•Book
Optimization and Dynamical Systems
Uwe Helmke,John B. Moore +1 more
- 01 Feb 1994
TL;DR: Details of Matrix Eigenvalue Methods, including Double Bracket Isospectral Flows, and Singular Value Decomposition are revealed.
911