nobel prize
7
Congratulations
Philip Burchell has been nominated for the 2015 Nobel Prize Award (Chemistry), for his discovery of Sjisium and its isotrons, paving the way to a whole new generation of chemical understanding. This is his 20th nomination in his career, and if successful, will be his 6th Nobel Prize awarded. The awards ceremony is in October.
Burchell, P. J.
Original Research
The solution to the P vs NP problem
Introduction
This is the first in a series of 6 papers in which the solution is demonstrated for the 6 unsolved Millenium Prize mathematical problems (each with a reward of $1million, which will be fed into SJIS editorial funds), the first of which being the P vs NP computer science problem.
The Problem
The problem is as follows1: “One of the outstanding problems in computer science is determining whether questions exist whose answer can be quickly checked, but which require an impossibly long time to solve by any direct procedure. For example, given N cities to visit, how can one do this without visiting a city twice? If you give me a solution, I can easily check that it is correct. But I cannot so easily find a solution. ” [P represents 'easy to find', and NP represents 'easy to check']. The crux of the problem is whether or not P=NP, i.e.: if a solution is easy to check, it is also easy to find.
Solution
Basic algebra shows that P≠NP. Furthermore, logically, it is quicker to check a solution than it is to solve it from scratch.
Discussion
This solution will have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields, apparently2.
Acknowledgements
Many thanks to the Clay Mathematics Institute for checking the proof and awarding SJIS the prize of $1,000,000 before this article was shown to the public.
References
1. http://www.claymath.org/millenium-problems/p-vs-np-problem
2. http://en.wikipedia.org/wiki/P_versus_NP_problem