Proof for P = NP
Take the travelling salesman problem (TSP). Since TSP is in NP-Complete and by defintion in NP, if you can find a polynomial algorithm then P = NP by definition. The solution is simple. In the future the salesman can teleport to each city thereby completely bypassing streets altogether. The path would be found in polynomial time by simply choosing a city you haven't been to and teleporting there making TSP an element of P. You do this by adding all cities to a list and then removing the city from the list when visited. This reduces to O(n) which is polynomial.
Therefore P = NP... QED.
I'll be petitioning the Clay Mathematics Institute for my $1,000,000 shortly.
Therefore P = NP... QED.
I'll be petitioning the Clay Mathematics Institute for my $1,000,000 shortly.