Memcomputing: Basics and Recent Progress

by Yuriy Pershin (University of South Carolina)

Monday Aug 29, 2022, 1:00 PM → 2:00 PM America/Chicago

Memcomputing is an emerging computing paradigm in which memory and massively-parallel dynamics plays the major role in the processing of information [1]. The basic units of memcomputing circuits ‒ memristors, memcapacitors or meminductors (memory circuit elements) [2] ‒ can store and process information on the same physical platform. In this respect, they are fundamentally different from the standard circuit components (such as resistors). In this talk, I will introduce the memory circuit elements and discuss their physical realizations. Moreover, I will present several examples of memcomputing circuits ranging from a maze solving circuit [3] to self-organizing gates in digital memcomputing machines [4], and discuss the advantage of memcomputing approach compared to classical computing algorithms.

 

 [1] M. Di Ventra and Y. V. Pershin, “The parallel approach”, Nature Physics, vol. 9, 200-202, 2013.

[2] M. Di Ventra, Y. V. Pershin, and L. O. Chua, “Circuit elements with memory: Memristors, memcapacitors, and meminductors,” Proc. IEEE, vol. 97, 1717–1724, 2009.

[3] Y. V. Pershin and M. Di Ventra, “Solving mazes with memristors: A massively parallel approach”, Phys. Rev. E, vol. 84, 046703, 2011.

[4] F. L. Traversa and M. Di Ventra, “Polynomial-time solution of prime factorization and NP-complete problems with digital MemComputing machines,” Chaos: An Interdisciplinary Journal of Nonlinear Science, vol. 27, 023107, 2017.