Hacker News new | ask | show | jobs
by jojomodding 323 days ago
The ad-hominem was maybe unwarranted, sorry. Let's get back to the subject matter by me repeating the material question in my comment above, which you ignored: "Complexity theorists routinely find out if two complexity classes are included in each other or not. Why would Gödel's Incompleteness Theorem stop them for P=NP in particular?"

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."
1 comments
Joel_Mckay 323 days ago
Personally I never saw degrees as an excuse to post nonsensical answers or troll people with personal barbs. P!=NP can be shown true for certain constrained sets, but P=NP was shown it can't currently be proven.

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

link
shusaku 323 days ago
Complaining about ad hominem and then writing that awful comment, you should be embarrassed.
link
jojomodding 322 days ago
> P!=NP can be shown true for certain constrained sets

What? That's not even wrong. What do you mean by that?

link
Joel_Mckay 322 days ago
"Directions (I speak no English)"

https://www.youtube.com/watch?v=6vgoEhsJORU

Best of luck =3

link