Turing's work on computability

Alan Turing's work on computability explored what problems a machine can solve through algorithms. He introduced the concept of a theoretical "Turing machine," an abstract device that manipulates symbols based on a set of rules, representing how computers process information. Turing demonstrated that some problems are inherently unsolvable by any algorithm, establishing the limits of computation. His work laid the foundation for modern computer science by clarifying which problems can be automated and how to approach complex calculations systematically.