Shared publicly  - 
This is amazing geek porn. NSA recently declassified a letter from John Nash to the NSA in in 1955 (which they ignored) in which he essentially described modern cryptography methods some 20 years before they were rediscovered and implemented.
Marc Jansen's profile photoRichard Carter's profile photogueroo guero's profile photoJason Jimenez's profile photo
Jesse H
Thank you for sharing the article and the post. Excellent read for a Friday afternoon.
Elise, I've never found a person who liked the book who liked the movie, which basically took the position, moviegoers are dumb and will be bored by the math and Nash's real life, let's reinvent all of it.
I wish I knew what this was about. I read the article and was completely lost as to what the subject was about.
@ Jason Jimenez- If you don't know what the article is about then don't comment.
I'm commenting in hopes that someone would explain the article. I would like to know the basic idea of it. By the way, thanks for your help.
+Jason Jimenez Nash's letter seems to anticipate the P=NP problem, which was only articulated much later and is still a major unsolved question in computer science. Basically, right now there are problems where it's easy to check if a given answer is correct but hard to calculate that answer (NP). There are also problems where answers can be easily calculated (P). We assume these are distinct sets. If they are not (if P=NP), then problems which are assumed to be unsolveable (like some encryption algorithms) will actually be solveable. He also anticipates that proving that either way will be very hard and conjectures it might not even be possible.
+Ralf Haring, this is reminiscent of Gödel's Incompleteness Theorem, which proves that any logical system based on rudimentary arithmetic will yield statements that can be neither proved nor disproved.
Also, +Molly Wood's mention of "geek porn" made me chuckle. Not heard that one before.
The same John Nash that was featured in A Beautiful Mind? Fascinating!
Add a comment...