A problem solvable in principle may be unsolvable in practice. If the effort required grows explosively with size, even modest instances defeat the fastest machines. Feasibility, not mere computability, governs what gets done.
The intuition
Tractability concerns whether a problem can be solved with resources that grow gently with its size. Problems whose cost grows as a polynomial are considered feasible. Those whose cost explodes are not.
The structure
The mechanism of intractability is combinatorial growth. When the number of possibilities multiplies with each added element, brute search becomes hopeless almost immediately. The space outruns any machine.
The subtlety
The turn is that intractability is practical, not absolute. Such problems can be solved for small cases; they merely become impossible at scale. The wall is one of size, not of principle.
The price
Escape routes exist. Approximation, heuristics, and special structure often tame problems that are hard in the worst case, so practice frequently succeeds where theory despairs. Hardness in general permits ease in particular.
The boundary
The implication is that efficiency is a first-class concern. To be useful, a method must scale, and the study of what scales is as important as the study of what is possible. The feasible is a subset of the computable.
The larger point
Tractability asks whether a problem’s cost grows gently with size, separating the feasible from the merely computable. Combinatorial explosion makes many problems hopeless at scale, though approximation often helps. Efficiency, not possibility, decides what can be done. Seen this way, the concept is less a fact to be filed than a lens through which other facts arrange themselves. Its worth lies not in any single application but in the pattern of thought it makes available. To hold it clearly is to see a whole family of problems as variations on one theme, and to recognize the same shape recurring where it was not expected.
