So sci, how can I simulate the AND gate using the NAND gate?
>>7723024
It literally tells you how in the question...
>>7723035
https://en.wikipedia.org/wiki/Sheffer_stroke
>>7723035
so... should I simply remove the negation and That's it?
>>7723024
NOT A <==> A NAND A
>>7723047
A AND B <==> (A NAND B) NAND (A NAND B)
>>7723045
You're retarded. Just quit whatever program you're doing and switch to Arts.
>>7723057
CS is Arts, /sci approves
>>7723045
how the fuck would you remove the negation?
you add a second negation.
retard
negate both inputs and you get an or gate.
or something.
>>7723089
this is troll right
(A NAND A) NAND (B NAND B)
try drawing it out OP.
>>7723101
stop trolling this A OR B <==> (A NAND A) NAND (B NAND B)
>>7723024
This is high school shit.
I remember doing this back before my A levels.
Fucking underage, negative IQ, shitposter.
>Help sci, do my homework.
Come on. It's 2015.
>>7723024
A NAND A = NOT A
Thus (A NAND B) NAND (A NAND B) = NOT (A NAND B) = A AND B
>>7723024
Nope, can't do it. I can't convince myself.
>magic voodoo
>>7723035
output of NAND gate goes into NOT gate
>>7723024
Here you go you lazy fuck.
