Does P=NP
What do you think about P=NP
Landon Lee
Ayden Cox
No, we're not doing this thread today. Fuck off.
Zachary Davis
What if P actually equaled 0 this whole time? I bet the computer scientists would feel pretty silly.
Daniel Howard
That would be pretty funny.
James Wood
It's better than the constant /pol/ threads
Luis Hughes
It's not like we need to have one or the other.
I'm also not sure it is but it's a pretty close thing.
Connor Powell
Well, as a Computer Scientist, I will have you know that this problem is highly integral to the fundamental nature of the universe. For instance, when you have a computer, and you want it to solve an a problem that's easy to solve when you have the answer, then you've got an NP hard problem. Surprisingly, we Computer Scientists are good at naming things, because NP hard problems are, in fact, very hard, that is, unless you already know the answer. So for instance, say you want your calculator to solve Sudoku. Well, if you know the answer, then it's easy to solve, but you don't know it, then it's hard, in fact unless you know the answer, then it's not easy. Therefore, Sudoku is NP hard, very hard in fact, as you might expect. Then take for example, calculating the nth digit of pi. That's also very hard, because pi never ends, but if you already know the nth digit, then it's very easy, but remember how I said it was hard if you don't already know the answer? That's what makes this an NP hard problem. So then you might think, well what if I just solve the hardest NP hard problem, then I'll have solved all of them? But sadly that doesn't work, because if you have some problem, you can always make a harder problem. For example rather than just asking, how do I compute this, you might instead ask how do i compute this twice? And viola, you've got a twice as hard problem, so therefore, there is no NP hardest problem. Your other choice then might be, well what if I solve all of them? And you know what? That's very hard. In fact, solving an algorithm is an NP hard problem, so in order to solve it, you would have to solve it, which is just impossible. I know this might all be very hard to understand, in fact I just passed my computational theory for Computer Scientists class last semester, and even I have troubles sometimes grasping all of the fancy math stuff, like proof by interrogative and all that stuff. So don't feel bad if this is all hard, because it's really NP hard!
Cameron Diaz
I wasn't posting this to be a troll or for fun, I wanted a serious discussion about this. I find it very interesting, I think about this everyday I just didn't know it was P=NP until today. I always think to myself i'm sure there is an easier way to solve this problem. I am talking about any problem not just in life not just math. There has to be easier way to do things than what we think is the easiest way to do those things.
Eli James
>I think about this everyday I just didn't know it was P=NP until today
Why must you turn this board into a house of lies?
Robert Ward
I understand it, it's easy for me to understand I am going to school now to become a computer scientist, I have about 3 years left. It's weird I suck at math but I know I have to learn it. When it comes to computers, it's very easy for me I have been around computers since I was 6 now I am 27. I guess I have the right mind for a computer scientist you could say.