1. A. Church, A note on the Entscheidungsproblem. J. Symbolic Logic 1, 40–41, 101–102 (1936a)
2. A. Church, An unsolvable problem of elementary number theory. Am. J. Math. 58, 345–363 (1936b) (Also in M. Davis, The Undecidable (Raven Press, Hewlett, 1965), pp. 89–107)
3. N.J. Cutland, Computability; An Introduction to Recursive Function Theory (Cambridge University Press, Cambridge, 1980)
4. M. Davis, Computability and Unsolvability (McGraw-Hill, New York, 1958a)
5. K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Math. Phys. 38, 173–198 (1931) (Also in English in M. Davis, The Undecidable (Raven Press, Hewlett, 1965), pp. 5–38)