The notion that some computational problems in math and computer science can be hard should come as no surprise. There is, in fact, an entire class of problems deemed impossible to solve algorithmically. Just below this class lie slightly “easier” problems that are less well-understood—and may be impossible, too.
Click here for original story, Researcher develops new tool for understanding hard computational problems that appear intractable
Source: Phys.org