 The paper in which this result is presented, entitled “An Unsolvable Problem of Elementary Number Theory” (1936a), is a great classic of logic and computability theory, but it has been somewhat overshadowed by the almost contemporaneous and brilliant paper by Turing (1936), as well as the earlier remarkable incompleteness theorems of Gödel (1931). In this section, Church’s paper takes center stage.