Search Results for author: Fabio L. Traversa

Found 10 papers, 0 papers with code

Projective Embedding of Dynamical Systems: uniform mean field equations

no code implementations7 Jan 2022 Francesco Caravelli, Fabio L. Traversa, Michele Bonnin, Fabrizio Bonani

We study embeddings of continuous dynamical systems in larger dimensions via projector operators.

Memcomputing: Leveraging memory and physics to compute efficiently

no code implementations20 Feb 2018 Massimiliano Di Ventra, Fabio L. Traversa

In this perspective we discuss how to employ one such property, memory (time non-locality), in a novel physics-based approach to computation: Memcomputing.

Combinatorial Optimization

Accelerating Deep Learning with Memcomputing

no code implementations1 Jan 2018 Haik Manukian, Fabio L. Traversa, Massimiliano Di Ventra

In fact, the acceleration of pretraining achieved by simulating DMMs is comparable to, in number of iterations, the recently reported hardware application of the quantum annealing method on the same network and data set.

On the Universality of Memcomputing Machines

no code implementations23 Dec 2017 Yan Ru Pei, Fabio L. Traversa, Massimiliano Di Ventra

We show that UMMs can simulate both types of machines, hence they are both "liquid-" or "reservoir-complete" and "quantum-complete".

Evidence of an exponential speed-up in the solution of hard optimization problems

no code implementations23 Oct 2017 Fabio L. Traversa, Pietro Cicotti, Forrest Sheldon, Massimiliano Di Ventra

However, despite numerous research efforts, in many cases even approximations to the optimal solution are hard to find, as the computational time for further refining a candidate solution grows exponentially with input size.

Memcomputing Numerical Inversion with Self-Organizing Logic Gates

no code implementations13 Dec 2016 Haik Manukian, Fabio L. Traversa, Massimiliano Di Ventra

We propose to use Digital Memcomputing Machines (DMMs), implemented with self-organizing logic gates (SOLGs), to solve the problem of numerical inversion.

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

no code implementations18 Nov 2014 Fabio L. Traversa, Chiara Ramella, Fabrizio Bonani, Massimiliano Di Ventra

Even though the particular machine presented here is eventually limited by noise--and will thus require error-correcting codes to scale to an arbitrary number of memprocessors--it represents the first proof-of-concept of a machine capable of working with the collective state of interacting memory cells, unlike the present-day single-state machines built using the von Neumann architecture.

Memcomputing with membrane memcapacitive systems

no code implementations14 Oct 2014 Yuriy V. Pershin, Fabio L. Traversa, Massimiliano Di Ventra

We show theoretically that networks of membrane memcapacitive systems -- capacitors with memory made out of membrane materials -- can be used to perform a complete set of logic gates in a massively parallel way by simply changing the external input amplitudes, but not the topology of the network.

Universal Memcomputing Machines

no code implementations5 May 2014 Fabio L. Traversa, Massimiliano Di Ventra

We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location.

Data Compression

Cannot find the paper you are looking for? You can Submit a new open access paper.