What does it mean for a problem to be computable?

A problem is computable if there exists an algorithm or Turing machine that can solve it, meaning the machine can provide a correct output for any valid input in a finite amount of time. In other words, a computable problem can be resolved using a systematic procedure or a well-defined set of rules.