A problem is decidable if a Turing machine can determine in finite time whether the answer is yes or no for any given input. A decidable problem has an algorithm that can find the solution for any input in a finite number of steps. Examples of decidable problems include determining if a number is prime or if a string is a palindrome.