Programmer Humor

32442 readers

863 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

Posts must be relevant to programming, programmers, or computer science.
No NSFW content.
Jokes must be in good taste. No hate speech, bigotry, etc.

founded 5 years ago

MODERATORS

[email protected]

1093

trick OR treat (media.infosec.exchange)

submitted 1 year ago by [email protected] to c/[email protected]

21 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] [email protected] 10 points 1 year ago* (last edited 1 year ago) (1 children)

Me, fresh out of COMP301, bragging about how I can make any halloween costume out of only xor gates

[–] [email protected] 4 points 1 year ago (1 children)

You mean NAND gates?

(Trick NAND Trick) NAND (Treat NAND Treat) <-> Trick or Treat

[–] [email protected] 2 points 1 year ago (1 children)

pretty sure both work

[–] [email protected] 1 points 1 year ago (2 children)

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

[–] [email protected] 2 points 1 year 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

[–] [email protected] 0 points 1 year ago* (last edited 1 year ago)

pretty sure I meant to say nor