P vs NP
Okay, so I'm a nobody on the internet. I have a keyboard, no posted data that's easy to trace back to me, and a poor education, and an IQ of 69 (that's high, right?). I think it's fun to get people into a rage about some things like the indisputable fact that Steve Jobs regularly uses a computer that runs Windows XP or that 9/11 never happened (I mean c'mon, those people don't know that?)
So I found this boring old C++ forum with all this techy nerdy talk that really doesn't mean anything (I mean c'mon, who the heck knows what the word "polymorphism" means?) But, they seem like an easy to troll bunch of losers (especially that Albatross, that birdbrain), so I asked on the king of all troll websites (now 7 years old!) what gets nerds to rage each time. Now, the majority said religion or which operating system is the best, but that sounded like it was just plain boring, and then one guy named Seagull posted some weird questions that you'd have to be a genius to understand, but I thought I'd give it a shot.
"Does P = NP or P != NP? If so or if not, why do you think so?"
Now I don't know what the heck this means, so I'd like you cppf**s to tell me what the **** it's supposed to mean, and what the answers to these two questions are. In return, you get a pic of me. Please reply, I really want to get you all angry.
-Dodo
...okay, seriously. All the joking aside, do you think the set of NP-complete problems can be solved in P time, and if so why, and if not, again why? I'm not looking to start a flamewar here despite whatever jokes I might have made on #cplusplus or above this text, just some rational and cool-headed discussion.
-Albatross
So I found this boring old C++ forum with all this techy nerdy talk that really doesn't mean anything (I mean c'mon, who the heck knows what the word "polymorphism" means?) But, they seem like an easy to troll bunch of losers (especially that Albatross, that birdbrain), so I asked on the king of all troll websites (now 7 years old!) what gets nerds to rage each time. Now, the majority said religion or which operating system is the best, but that sounded like it was just plain boring, and then one guy named Seagull posted some weird questions that you'd have to be a genius to understand, but I thought I'd give it a shot.
"Does P = NP or P != NP? If so or if not, why do you think so?"
Now I don't know what the heck this means, so I'd like you cppf**s to tell me what the **** it's supposed to mean, and what the answers to these two questions are. In return, you get a pic of me. Please reply, I really want to get you all angry.
-Dodo
...okay, seriously. All the joking aside, do you think the set of NP-complete problems can be solved in P time, and if so why, and if not, again why? I'm not looking to start a flamewar here despite whatever jokes I might have made on #cplusplus or above this text, just some rational and cool-headed discussion.
-Albatross
Last edited on
Come on. It's not like P=NP? is a really polemic subject.
More importantly, do you think it's possible to measure faster than factorial time the circumference of your mom?
Fun fact: The only result Google gives for "faster than factorial time" is "Contrary to the reply of the general to Hitler, faster than factorial time solutions to the traveling salesman problem have been discovered, though none are in deterministic polynomial time."
And then this link:
http://www.youtube.com/watch?v=GSIodz9GWxc
| do you think the set of NP-complete problems can be solved in P time |
Fun fact: The only result Google gives for "faster than factorial time" is "Contrary to the reply of the general to Hitler, faster than factorial time solutions to the traveling salesman problem have been discovered, though none are in deterministic polynomial time."
And then this link:
http://www.youtube.com/watch?v=GSIodz9GWxc
Topic archived. No new replies allowed.