Evidence of an exponential speed-up in the solution of hard optimization problems
Oct 23, 2017 Evidence of an exponential speed-up in the solution of hard optimization problems Fabio Lorenzo Traversa, Massimiliano Di Ventra, Pietro Cicotti, Forrest Sheldon, Optimization problems pervade essentially every scientific discipline and industry. Many…
Interview with MemComputing CEO, John Beane
Listen in to our CEO John Beane discuss MemComputing and its applications in this fascinating podcast with the folks from BisTalk Radio.
Memcomputing compute engine rivals Supercomputer Processing Speeds
Improve the Performance of Machine Learning Optimization Calculations by 4 Orders of Magnitude or More San Diego, CA, September 18, 2017– MemComputing Inc. is launching the first of many software-based coprocessors that solve complex problems…
Instantons in Self-Organizing Logic Gates
Aug 29, 2017 Instantons in Self-Organizing Logic Gates Sean R. B. Bearden, Haik Manukian, Fabio L. Traversa, and Massimiliano Di Ventra Self-organizing logic is a recently suggested framework that allows the solution of Boolean truth tables…
Absence of chaos in Digital Memcomputing Machines with solutions
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…
Memcomputing Numerical Inversion With Self-Organizing Logic Gates
Dec 13, 2016 Memcomputing Numerical Inversion With Self-Organizing Logic Gates Fabio Lorenzo Traversa, Massimiliano Di Ventra, Haik Manukian We propose to use digital memcomputing machines (DMMs), implemented with self-organizing logic gates (SOLGs), to solve the…
Topological Field Theory and Computing with Instantons
Sep 11, 2016 Topological Field Theory and Computing with Instantons Fabio Lorenzo Traversa, Massimiliano Di Ventra, Igor V. Ovchinnikov It is well known that dynamical systems may be employed as computing machines. However, not all…
Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines
Dec 16, 2015 Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines Fabio Lorenzo Traversa, Massimiliano Di Ventra We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able…