Forgive me if this is absolutely ridiculously stupid.
Let us define P as the problem space which consists of all of the problems that can be solved in PTIME. Let us define NP as the problem space of the which consists of problems that can be solved in NPTIME. We can say P=NP if P’s problem space contains all of the problems that NP contains and no more. Assume that P=NP. Because P=NP, the decision problem P=?NP must itself be a part of the problem space. Because we have limited knowledge of the problem space, we must use a problem generator to complete a brute-force search of the problem space. This is NP-Hard for even the linear search (generating all permutations (problems) of inpu
