https://www.youtube.com/watch?v=IuX8QMgy4qE
Algorithmic isomorphism practically ensures most CS approaches will fail to formally model the problem clearly. To be blunt, that million dollar prize will be waiting around a long time.
An infinite amount of Papers do not necessarily have to converge on a correct solution. =3
Why would Gödel's Incompleteness Theorem stop them for P=NP in particular?
Why is the current definition of P or NP insufficiently formal or clear?
PS: Citing YouTube Videos in mathematical discussions is a big red flag indicating you have not really understood things.
> "not really understood things"
Something currently impossible to prove is by definition confusing. lol =3
PS: I read through the transcript of the YouTube video you linked (and also know the material from my CS degree education) so I do in fact know what Gödel's Incompleteness Theorem is. Note that the video is really not about P=NP at all, not any more than it is about 1+1=2. The use of P=NP in the video was just to give an example of "what is a statement."
People can twist it anyway they like, but stating they can "sort of" disprove or prove P=NP is 100% obfuscated BS. That is why the million dollar prize remains unclaimed.
Have a great day, =3
What? That's not even wrong. What do you mean by that?
https://www.youtube.com/watch?v=6vgoEhsJORU
Best of luck =3