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. © 2010 The Institution of Engineering and Technology.
Cite
CITATION STYLE
APA
Lehtonen, E., Poikonen, J. H., & Laiho, M. (2010). Two memristors suffice to compute all Boolean functions. Electronics Letters, 46(3), 230–231. https://doi.org/10.1049/el.2010.3407
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free