P=NP, EXECUTIVE SUMMARY ON MATH AND SCIENCE

Technologi es’ Best Opportunity for Expansion,

The singly most important unresolved question in computer

science and complex number theory is the question:

𝐷𝑜𝑒𝑠 𝑃 = 𝑁𝑃?

If P does not equal NP

Our knowledge of the universe and technology is restricted. Certain elements of computation and logic
are simply governed by natural laws of physics grounded in chaos theory.

If P does equal NP

The Universe is a highly ordered place governed by certain truths grounded in fundamental physics. We
will continue to discover, through mathematics , science, and technology, vast new frontiers.

The Expert Opinions:

“If P=NP, then the world would be a profoundly different place than we usually assume it
to be. There would be no special value in “creative leaps,” no fundamental gap between
solving a problem and recognizing the solution once it’s found. Everyone who could
appreciate a symphony would be Mozart; everyone who could follow a step-by-step
argument would be Gauss...”

— Scott Aaronson, MIT

Being attached to a speculation is not a good guide to research planning. One should
always try both directions of every problem. Prejudice has caused famous
mathematicians to fail to solve famous problems whose solution was opposite to their
expectations, even though they had developed all the methods required.

—Anil Nerode, Cornell University

 C HAPTER 1

P=NP, EXECUTIVE SUMMARY ON MATH AND SCIENCE

Technologi es’ Best Opportunity for Expansion

HOW TO UNDERSTAND P VERSUS NP

Courtesy of the Clay Mathematics Institute: Suppose that you are organizing housing accommodations for a group

of four hundred university students. Space is limited and only one hundred of the students will receive places in
the dor mitory. To complicate matters, the Dean has provided you with a list of pairs of incompatible studen ts, and

requested that no pair from this list appear in your final choice. This is an example of what computer scientists call
an NP-problem, since it is easy to check if a given choice of one hundred students proposed by a coworker is
satisfactory (i.e., no pair taken from your coworker's list also appears on the list from the Dean's office), however

the task of generating such a list from scratch seems to be so hard as to be completely impractical. Indeed, the
total number of ways of choosing one hundred students from the four hundred applicants is greater than the

number of atoms in the known universe! Thus no future civilization could ever hope to build a supercomputer
capable of solving the problem by brute force; that is, by checking every possible combination of 100 students.

However, this apparent difficulty may only reflect the lack of ingenuity of your programmer. In fact, one of the

outstanding problems in computer science is deter mining whether questions exist whose answer can be quickly
checked, but which require an impossibly long time to solve by any direct procedure. Problems like the one listed

above certainly seem to be of this kind, but so far no one has managed to prove that any of them r eally are so hard
as they appear, i.e., that there really is no feasible way to generate an answer with the help of a computer.

Stephen Cook and Leonid Levin formulated the P (i.e., easy to find) versus NP (i.e., easy to check) problem

independently in 1971. (To referen ce Mr. Cook’s description of the problem:

http://www.claymath.org/millennium/P_vs_NP/pvsnp.pdf)
 𝑻𝑯𝑬 𝑷 𝑽𝑬𝑹𝑺𝑼𝑺 𝑵𝑷 𝑺𝑶𝑳𝑼𝑻𝑰𝑶𝑵

MARTIN M. MUSATOV

1. STATEMENT OF THE SOLUTION

This solution to P versus NP explains how every language accepted by some non
deterministic algorithm in polynomial time can be accepted by some (deterministic)
algorithm in polynomial time. To define the solution it is formally it is necessary to
observe the model of a computer, or Turing machine and process information in
real-time as it is received as a computable function or linear stream.

Formally, the class P contains the in decision problems

⋯ ⋯
P= ⋮ ⋱ ⋮ 𝑁 ⋮ ⋱ ⋮ 𝑃
⋯ ⋯
Continue the expansion:

Area of a Circle: 𝐴 = 𝜋𝑟2

𝑛
𝑛 𝑛
Binomial Theorem: 𝑥+𝑎 = 𝑘
𝑥 𝑘 𝑎𝑛−𝑘
𝑘=0

𝑛 𝑛𝑥 𝑛 𝑛−1 𝑥 2
Expansion of a Sum: 1+𝑥 =1+ + +⋯
1! 2!

∞
𝑛𝜋𝑥 𝑛𝜋𝑥
Fourier series: 𝑓 𝑥 = 𝑎0 + 𝑎𝑛 cos + 𝑏𝑛 sin
𝐿 𝐿
𝑛=1

Pythagorean Theorem: 𝑎2 + 𝑏 2 = 𝑐 2

−𝑏± 𝑏 2 −4𝑎𝑐
Quadratic Formula: 𝑥= 2𝑎

𝑥 𝑥2 𝑥3
Taylor Expansion: 𝑒 𝑥 = 1 + 1! + + 3 ! + ⋯ , −∞ < 𝑥 < ∞
2!

1 1
Trig Identity 1: sin 𝛼 ± sin 𝛽 = 2 sin 2 𝛼 ± 𝛽 cos 2 𝛼 ∓ 𝛽

1 1
Trig Identity 2: cos 𝛼 + cos 𝛽 = 2 cos 2 𝛼 + 𝛽 cos 2 𝛼 − 𝛽

Conclusion: Binary revisions are allowed given the above formulas.