Some problems are intractable. What does it mean for a problem to be described as intractable?
An intractable problem is a problem that is solvable, but not in polynomial time or less. Such problems cannot be solved in time considered to be reasonable (i.e. not solvable quick enough to be 'useful').
HB
Related Computing A Level answers
All answers ▸How can I decide whether Quicksort or Mergesort is better for a given situation?
How to represent a negative decimal number using 8-bit binary two's complement ?
What the main differences between an interpreter and a compiler?
How can the idea of precondtioning as part of 'Thinking Ahead' benefit a programmer when writing code?