Show a half-adder with only NAND gates.
I knew for half-adder that c = xy and s = xNORy
I feel like this will become a never ending cycle of putting double bars and making
NOTx = xNANDx
You can make NOT gates from NAND.
So you can make AND gates from NOT and NAND.
Now, you can make OR gates from NOT and AND (use DeMorgan's)
Now you can make anything. Won't be an endless cycle, because the above list of gate dependencies is not circular.
Yes, i can make OR gates from NOT and AND.
When I want to get OR back to NAND, however, I need to double bar so I can use a bar in DeMorgan's to get NAND back.
Then, I am left with one bar, which I need to get rid of by making NOT and AND an OR gate.
I am then back where I started.