Examples
- Examples of using the
NANDcompleteness. As illustrated by,- ¬A = A
NANDA - A ∧ B = (A
NANDB)NAND(ANANDB) - A ∨ B = (A
NANDA)NAND(BNANDB)
- ¬A = A
- Examples of using the
NORcompleteness. As illustrated by,- ¬A = A
NORA - A ∧ B = (A
NORA)NOR(BNORB) - A ∨ B = (A
NORB)NOR(ANORB)
- ¬A = A
Note that, an electronic circuit or a software function is optimized by the reuse, that reduce the number of gates. For instance, the "A ∧ B" operation, when expressed by NAND gates, is implemented with the reuse of "A NAND B",
- X = (A
NANDB); A ∧ B = XNANDX
Read more about this topic: Functional Completeness
Famous quotes containing the word examples:
“No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
—André Breton (18961966)
“There are many examples of women that have excelled in learning, and even in war, but this is no reason we should bring em all up to Latin and Greek or else military discipline, instead of needle-work and housewifry.”
—Bernard Mandeville (16701733)
“Histories are more full of examples of the fidelity of dogs than of friends.”
—Alexander Pope (16881744)