Sep 17, 2017

Absence of periodic orbits in digital memcomputing machines with solutions

Fabio L. Traversa, and Massimiliano Di Ventra

---

In Traversa and Di Ventra [Chaos 27, 023107 (2017)] we argued, without proof, that if the non-linear dynamical systems with memory describing the class of digital memcomputing machines (DMMs) have equilibrium points, then no periodic orbits can emerge. In fact, the proof of such a statement is a simple corollary of a theorem already demonstrated in Traversa and Di Ventra [Chaos 27, 023107 (2017)]. Here, we point out how to derive such a conclusion. Incidentally, the same demonstration implies absence of chaos, a result we have already demonstrated in Di Ventra and Traversa [Phys. Lett. A 381, 3255 (2017)] using topology. These results, together with those in Traversa and Di Ventra [Chaos 27, 023107 (2017)], guarantee that if the Boolean problem the DMMs are designed to solve has a solution, the system will always find it, irrespective of the initial conditions.

Go To Publication  →

• All Tags Absence of periodic orbits in digital memcomputing machines with solutions Accelerating Deep Learning with Memcomputing Aircraft Loading Optimization: MemComputing the 5th Airbus Problem Coupled oscillator networks for von Neumann and non von Neumann computing Digital Memcomputing: from Logic to Dynamics to Topology Directed percolation and numerical stability of simulations of digital memcomputing machines Dynamic computing random access memory: A brain-inspired computing paradigm with memelements Efficient solution of Boolean satisfiability problems with digital memcomputing Evidence of an exponential speed-up in the solution of hard optimization problems Global minimization via classical tunneling assisted by collective force field formation Instantons in Self-Organizing Logic Gates MemComputing Integer Linear Programming Memcomputing Numerical Inversion With Self-Organizing Logic Gates Memcomputing: Leveraging memory and physics to compute efficiently Mode-Assisted Unsupervised Learning of Restricted Boltzmann Machines On the Universality of Memcomputing Machines Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines Stress-testing memcomputing on hard combinatorial optimization problems Taming a non-convex landscape with dynamical long-range order: memcomputing the Ising spin-glass Topological Field Theory and Computing with Instantons