Halting Problem

• The algorithms in the middle bin have known solutions, but they are called intractable because for data of any size they simply take too long to execute

• A problem is said to be in Class NP if it can be solved with a sufficiently large number of processors in polynomial time