Analysis of Boolean Logic Gates Logical Complexity for Use with Spiking Memristor Gates

DOI10.1007/978-3-319-41312-9_9zbMath1476.68083OpenAlexW2474349066MaRDI QIDQ2819146

Ella Gale

Publication date: 28 September 2016

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41312-9_9

zbMATH Keywords

memristorBoolean logictrinary logic gates

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• On Sheffer symmetric functions in three-valued logic
• Boolean Logic Gates from a Single Memristor via Low-Level Sequential Logic

This page was built for publication: Analysis of Boolean Logic Gates Logical Complexity for Use with Spiking Memristor Gates