A set of logic gates is called "functionally complete" if some combination of the gates can be used to do each of the basic logic operations AND, OR, and NOT. The claim is the NAND gate is functionally complete. Similarly, the NOR gate is functionally complete. Given two variables, X and Y using only NAND gates, Logic 0 and Logic 1 inputs give the logic equation using just NAND operators to produce the NOT, AND and OR functions.
The equations using the NAND operator are:
The equations for AND, OR and NOT using only the NOR operator are:
Can someone see if those are right?
Can someone work out x + y OR x * y for the NOR operator on a truth table for me?
The equations using the NAND operator are:
Rich (BB code):
X' = X NAND 1
X + Y = x' NAND y' ???
X * Y = (x NAND y)' ?????
Rich (BB code):
X' = X NOR 0 ?????
X + Y = (X NOR Y) NOR 0
X * Y = ?
Can someone work out x + y OR x * y for the NOR operator on a truth table for me?