Ok, so I just had a very interesting guest lecture about the use of the Scanning Tunnelling Microscope to form atomic scale logic gates, but there was quite an elementary question that befuddled me and I forgot to ask. I've never done any electronics, so I've never come across this Boolean logic or propositional calculus. But I imagine some of you have (because you're all nerds), so I'll ask you.
The guy posted up this truth table for an AND gate
and this for the XOR gate
And it's my understanding that you form a NAND (not and) gate by inverting the AND truth table. So wouldn't that make the NAND truth table the same as the XOR truth table? (Changing all the 'TRUE' to 'FALSE'). Are they the same object? I'm presuming they're not, but what is the difference? Is there also a NOXOR (not XOR) gate? Is this different from AND?
The guy posted up this truth table for an AND gate
Code:
| y = true | y = false --------------------------- x=true | TRUE | FALSE x=false | FALSE | FALSE
and this for the XOR gate
Code:
| y = true | y = false ---------------------------- x=true | FALSE | TRUE x=false | TRUE | TRUE
And it's my understanding that you form a NAND (not and) gate by inverting the AND truth table. So wouldn't that make the NAND truth table the same as the XOR truth table? (Changing all the 'TRUE' to 'FALSE'). Are they the same object? I'm presuming they're not, but what is the difference? Is there also a NOXOR (not XOR) gate? Is this different from AND?
"The trouble with the world is that the stupid are cocksure and the intelligent are full of doubt. " - Bertrand Russell
The Triumph of Stupidity in Mortals and Others 1931-1935
The Triumph of Stupidity in Mortals and Others 1931-1935