>>12365973It's if non polynomial time check also means non polynomial solution for problem.
If we prove that just one problem exists, that cannot be truly reduced, we prove P!=NP.
And that is problem of assigning each element of Nth dimensional array a pointer which doesn't hold a non polynomial time.
Therefore P!=NP if you think in sets.
Because you can check if every pointer was set by length of pointer array, but you cannot set every pointer so goddamn fast.
This disproves that for every, but it's a question of single.
But you can come with some poly time problem that has log(n) or 1 solution time.
