I agree that it can sometimes be frustrating to find the right information online, but your absurd pronouncements, e.g. "This is why Computer science isn't that

I agree that it can sometimes be frustrating to find the right information online, but your absurd pronouncements, e.g. "This is why Computer science isn't that popular anymore, and why more people are not studying it as much." serves only to marginalize you and discourage people from trying to help you out. Again, I understand your frustration, but please consider that certain topics, especially in math and cs, cannot be readily understood without a bit of preparation and that you might just not be grasping what you read because you aren't quite ready. The first answer on this post: https://news.ycombinator.com/item?id=5667089 https://news.ycombinator.com/item?id=5667089 was pretty helpful, what didn't you get about it? To summarize the answer: there are certain problems which are easy to solve and certain problems are seemingly hard to solve but we know are easy to check (if we've arrived at the right solution). P = NP is simply the question, "are the class of problems in NP (the hard ones) actually just as easily solved as the set of P problems or can we prove definitely that there is no efficient algorithm to solve the NP problems?"