@Masimatutu@lemm.ee to Programmer Humor@lemmy.ml • 2 years agotrick OR treatmedia.infosec.exchangeimagemessage-square21fedilinkarrow-up11.15Karrow-down19
arrow-up11.14Karrow-down1imagetrick OR treatmedia.infosec.exchange@Masimatutu@lemm.ee to Programmer Humor@lemmy.ml • 2 years agomessage-square21fedilink
minus-squarewvstolzinglinkfedilink4•2 years agoYou mean NAND gates? (Trick NAND Trick) NAND (Treat NAND Treat) <-> Trick or Treat
minus-squarewvstolzinglinkfedilink1•2 years agoNAND and XOR aren’t equivalent, though | X | Y | X NAND Y | | 0 | 0 | 1 | | 1 | 0 | 1 | | 0 | 1 | 1 | | 1 | 1 | 0 | | X | Y | X XOR Y | | 0 | 0 | 0 | | 1 | 0 | 1 | | 0 | 1 | 1 | | 1 | 1 | 0 | & XOR can be reduced to NAND; not sure if NAND can be reduced to XOR
minus-squaremyslsllinkfedilink2•2 years ago@walthervonstolzing @AntiOutsideAktion If ya’ll get bored and wanna read more about this, this is a property called functional completeness. I’m pretty sure nand and nor are the only functionally complete binary operators, so xor shouldn’t be functionally complete. https://en.m.wikipedia.org/wiki/Functional_completeness
minus-squareAntiOutsideAktion [he/him]linkfedilinkEnglish0•edit-22 years agopretty sure I meant to say nor
You mean NAND gates?
(Trick NAND Trick) NAND (Treat NAND Treat) <-> Trick or Treat
pretty sure both work
NAND and XOR aren’t equivalent, though
| X | Y | X NAND Y | | 0 | 0 | 1 | | 1 | 0 | 1 | | 0 | 1 | 1 | | 1 | 1 | 0 || X | Y | X XOR Y | | 0 | 0 | 0 | | 1 | 0 | 1 | | 0 | 1 | 1 | | 1 | 1 | 0 |& XOR can be reduced to NAND; not sure if NAND can be reduced to XOR
@walthervonstolzing @AntiOutsideAktion
If ya’ll get bored and wanna read more about this, this is a property called functional completeness. I’m pretty sure nand and nor are the only functionally complete binary operators, so xor shouldn’t be functionally complete.
https://en.m.wikipedia.org/wiki/Functional_completeness
pretty sure I meant to say nor