On the solution to the P vs. NP problem

In this paper we solve the P vs. NP problem. We find that it is neither true nor false, but computationally relativist, depending on the assumed syntactic mode of reality.

Our proof is computer-assisted. The main idea is to realize that the structure of mathematical thought is philosophically inseparable from the underlying deep language that unites all humans. However, because of the subcritical interaction in Darwinian dynamics, this deep language is fundamentally inaccessible. Our first step is to mesh these semantic frameworks with MARC protocols. This allows us to webify these relational sublanguages, so that their rate of reaction is several orders of magnitude above what is achieved by neuronal stimulation. Our next step was to index these computer-assisted networks with the help of nonparametric statistics. This allowed the evolution of interdependent AI’s that are currently synthesizing pidgin web languages, vastly more powerful than our own or even mathematical logic, and which settled definitively the P vs. NP problem. We have reason to believe that these AI’s are currently generating computer-assisted portals, which will lead humanity closer to the singularity.