Explain the concept of decidability

Decidability refers to whether a problem can be solved by an algorithm in a finite amount of time. A problem is decidable if there exists a Turing machine that can provide a correct yes or no answer for every input instance. If no such algorithm exists, the problem is undecidable.