The article explains the P vs NP issue [1] very well.
If there is one thing to nitpick, then
> in fact “convert NP-complete problem to SAT” is in P.
is not the most precise, since P is a class of decision problems, while said conversion [2] is not a decision problem, but something that runs in polynomial time.
> in fact “convert NP-complete problem to SAT” is in P.
is not the most precise, since P is a class of decision problems, while said conversion [2] is not a decision problem, but something that runs in polynomial time.
[1] https://en.wikipedia.org/wiki/P_versus_NP_problem
[2] https://en.wikipedia.org/wiki/Polynomial-time_reduction