The Memcomputing Paradigm
Massimiliano Di Ventra
UCSD, US
ABSTRACT
This talk will discuss how to employ memory (time non-locality) in a novel physics-based approach to computation, memcomputing, and its practical realization with self-organizing logic gates (SOLGs). SOLGs are terminal-agnostic gates that self-organize to always satisfy their logical proposition regardless to which terminal(s) the truth value is assigned. As examples, the talk will highlight the polynomial-time solution of prime factorization, the search version of the subset-sum problem, and approximations to the Max-SAT beyond the inapproximability gap using polynomial resources. The talk will also show that these digital memcomputing machines compute via an instantonic phase, implying that they are robust against noise and disorder. The digital memcomputing machines that are proposed can be efficiently simulated, are scalable and can be easily realized with available nanotechnology components. This work is supported in part by MemComputing, Inc. (http://memcpu.com).
