  In this article, I focus on the resiliency of the P=?NP problem. The main
point to deal with is the change of the underlying logic from first to
second-order logic. In this manner, after developing the initial steps of this
change, I can hint that the solution goes in the direction of the coincidence
of both classes, i.e., P=NP.
