P = NP ?
For my nerdier friends, I offer the following recent paper from the ACM on the current state of the P = NP question. What would it mean if P = NP? What would it mean if it doesn't. Will quantum computing destroy public-key cryptography. Though it gets a bit technical in places, it's a surprisingly almost readable paper.
For the romantic minded, I offer the following tale of romance gone horribly wrong. Who knew that computer science could save someone from a pathological liar. Make sure to know the difference between GET and POST.
And of course, the obligatory XKCD comic:
For the romantic minded, I offer the following tale of romance gone horribly wrong. Who knew that computer science could save someone from a pathological liar. Make sure to know the difference between GET and POST.
And of course, the obligatory XKCD comic: