Two memristors suffice to compute all Boolean functions (Organic and inorganic circuits and devices)

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.

[1]  D. Stewart,et al.  The missing memristor found , 2008, Nature.

[2]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[3]  Mika Laiho,et al.  Stateful implication logic with memristors , 2009, 2009 IEEE/ACM International Symposium on Nanoscale Architectures.

[4]  L. Chua.  Memristor-The missing circuit element , 1971 .

[5]  E. McCluskey.  Minimization of Boolean functions , 1956 .