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.
No takes yet. Share an insight, caveat, or question.
Lehtonen et al. (2010) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: