Absence of chaos in Digital Memcomputing Machines with solutions

Abstract

Digital memcomputing machines (DMMs) are non-linear dynamical systems designed so that their equilibrium points are solutions of the Boolean problem they solve. In a previous work [Chaos 27, 023107 (2017)] it was argued that when DMMs support solutions of the associated Boolean problem then strange attractors cannot coexist with such equilibria. In this work, we demonstrate such conjecture. In particular, we show that both topological transitivity and the strongest property of topological mixing are inconsistent with the point dissipative property of DMMs when equilibrium points are present. This is true for both the whole phase space and the global attractor. Absence of topological transitivity is enough to imply absence of chaotic behavior. In a similar vein, we prove that if DMMs do not have equilibrium points, the only attractors present are invariant tori/periodic orbits with periods that may possibly increase with system size (quasi-attractors).

References in corpus (2)

• Memcomputing: a computing paradigm to store and process information on the same physical platform
• Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

Cited by in corpus (11)

• Memcomputing: Leveraging memory and physics to compute efficiently
• Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing
• Instantons in self-organizing logic gates
• Digital Memcomputing: from Logic to Dynamics to Topology
• Directed percolation and numerical stability of simulations of digital memcomputing machines
• MemComputing Integer Linear Programming
• Memcomputing Numerical Inversion with Self-Organizing Logic Gates
• Hardware implementation of digital memcomputing on small-size FPGAs
• Memcomputing for Accelerated Optimization
• SPICE Modeling of Memcomputing Logic Gates
• Aircraft Loading Optimization: MemComputing the 5th Airbus Problem