Almost as bad as noncomputable problems are intractable ones (such as determining whether there is a guaranteed winning strategy for an arbitrary chess position), which cannot be solved in a reasonable amount of time.
ECONOMIST: Computer science
2.
The trouble is that even some simple-sounding problems (such as working out whether it is possible to cover an infinite plane with a given set of patterned tiles) are mathematically proven to be inherently noncomputable.