Two memristors suffice to compute all Boolean functions

Authors:

Abstract
It is proved that all Boolean functions can be computed using two memristors. To achieve this, a recursive conjunctive form for Boolean functions is introduced and its universality shown.

This publication has 3 references indexed in Scilit: