Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Further, XOR is an exclusive OR. In boolean logic, this means that the two values MUST be different. So 0 ^ 0 would 0, and 1 ^ 1 would also be 0. However, 1 ^ 0 would be 1.


Good point. It should probably be NAND: ~(W&X). Assuming that R is also a valid option, at least.


> XOR

> eXclusive OR

Who would've thought.


I was just trying to illustrate for the people that read HN that don't have CS backgrounds. Didn't mean to patronize you.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: