The relationship between the complexity classes P (Polynomial time) and NP (Nondeterministic Polynomial time) is an unsolved problem in theoretical computer science, and is considered by many theoretical computer scientists to be the most important problem in the field. The Clay Mathematics Institute, which is dedicated to increasing and disseminating mathematical knowledge, has included it in its list of Millennium Prize Problems; anyone who provides a satisfactory solution to the problem may be entitled to a USD $1,000,000 prize.

In August 6th, Vinay Deolalikar claimed to have proven P ≠ NP. The paper still needs specialist proof-reading.

Scott Aaronson, an MIT professor, wrote at his blog that he doesn’t plan to interrupt his vacation time in Israel and Greece, unless other experts who have studied the paper in detail find the solution satisfactory. In that case he’ll also personally supplement the million dollar prize by the amount of $200,000.

Read more about the P vs NP problem at Wikipedia.

Popularity: 1% [?]

Straight Statistics is a pressure group whose aim is to detect and expose the distortion and misuse of statistical information, and identify those responsible. It has been formed by a group of legislators, statisticians and journalists, chaired by the Labour peer Lord Lipsey.

Popularity: 1% [?]

Nature by Numbers from Cristóbal Vila on Vimeo.

Μια παρέλαση όρων της ακολουθίας Fibonacci, της χρυσής αναλογίας και της τριγωνοποίησης Delaunay.

[via] flowingdata

Popularity: 1% [?]