On Computable Numbers, with an Application to the Entscheidungsproblem

In 'On Computable Numbers, with an Application to the Entscheidungsproblem,' Alan Turing introduces the concept of the Turing machine, a theoretical model for computation that laid the foundation for modern computer science.

The paper addresses David Hilbert's Entscheidungsproblem, proving that there cannot be a general algorithm to determine the truth of all mathematical statements.

Turing's work not only resolved this problem but also defined computable numbers, which are numbers that can be calculated to any desired precision by a Turing machine.