Decidability refers to the ability to determine, using an algorithm, whether a statement or problem can be conclusively resolved as either true or false. It is a fundamental concept in computer science and logic, highlighting the limits of algorithmic computation and distinguishing between problems that are solvable and those that are not.