Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many teaspoons in a tablespoon? For questions like these, they’ve got you covered. There are certain innocent-sounding questions, though, that computer scientists believe computers will never be able to answer – at least not within our lifetimes. These problems are the subject of the P versus NP question, which asks whether problems whose solutions can be checked quickly can also be solved quickly. P versus NP is such a fundamental question that either designing a fast algorithm for…
This story continues at The Next Web
from The Next Web
Note : I Hope My My New News Article At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem Of DigioNews So You Trust My site you are always updated with Latest news Daily news Everyday. Only on DigioNews : At last! There’s an algorithm that’s closer than ever to solving the traveling salesperson problem
0 Comments