👉 In mathematics, a untractable problem is a problem for which there exists a finite set of algorithms that can be used to solve it in polynomial time. This means that given an input, the algorithm will always produce an output with the same complexity as the input. For example, the Traveling Salesman Problem (TSP) is a famous untractable problem because no efficient algorithm has been found for solving it. Similarly, the knapsack problem is also a well-known untractable
