Two memristors suffice to compute all Boolean functions

Two memristors suffice to compute all Boolean functions

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

Inspec keywords: Boolean functions; memristors

Other keywords: memristors; Boolean functions

Subjects: Resistors; Algebra


    1. 1)
    2. 2)
    3. 3)
      • Kuekes, P.: `Material implication: digital logic with memristors', Memristor and Memristive Systems Symp., 2008, UC Berkeley, CA, USA.
    4. 4)
      • Lehtonen, E., Laiho, M.: `Stateful implication logic with memristors', Proc. IEEE/ACM Int. Symp. on Nanoscale Architectures, 2009, San Francisco, CA, USA, p. 33–36.
    5. 5)
      • M. Karnaugh . The map method for synthesis of combinational logic circuits. Trans. AIEE Commun. Electron. , 1 , 593 - 598
    6. 6)
      • E.J. McCluskey . Minimisation of Boolean functions. Bell Syst. Tech. J. , 5 , 1417 - 1444

Related content

An Erratum has been published for this content:
Erratum for ‘Two memristors suffice to compute all Boolean functions’
This is a required field
Please enter a valid email address