Computable Numbers

 was the title of a scientific paper by Alan Turing, where he disproves David Hilbert's thesis that all mathematical problems are solvable.

Turing worked on this paper for over a year and published it before World War II. The proof uses the concept of a Universal Machine. (PROSE: The Turing Test)