Computability is a branch of computer science and mathematics that studies what problems can be solved by algorithms. It focuses on determining whether a problem can be solved in a finite amount of time using a well-defined procedure. This concept is essential for understanding the limits of what computers can do. Key figures in computability include Alan Turing, who introduced the Turing machine as a theoretical model for computation. This model helps to classify problems as either computable or non-computable, providing a framework for understanding the capabilities and limitations of algorithms and computational processes.