Two memristors suffice to compute all Boolean functions
Authors:
- 4 February 2010
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 46 (3) , 230-231
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.Keywords
This publication has 3 references indexed in Scilit:
- The missing memristor foundNature, 2008
- Memristor-The missing circuit elementIEEE Transactions on Circuit Theory, 1971
- Minimization of Boolean Functions*Bell System Technical Journal, 1956