DocumentCode
1415092
Title
Two memristors suffice to compute all boolean functions
Author
Lehtonen, Eero ; Poikonen, Jussi H. ; Laiho, Mika
Author_Institution
Dept. of Inf. Technol., Univ. of Turku, Turku, Finland
Volume
46
Issue
3
fYear
2010
Firstpage
239
Lastpage
240
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
Boolean functions; memristors; Boolean functions; memristors;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el.2010.3407
Filename
5410671
Link To Document