Tractable problems in computational theory are those that can be solved in polynomial time, meaning the time required to solve them scales reasonably with the size of the input. These problems are considered efficiently solvable, making them practical for real-world applications as opposed to intractable problems which require exponential time solutions.