In this corrected reprint of the work originally published by Raven Press Books, Ltd., Hewlett, New York, in 1965, Davis (emeritus, mathematical sciences, New York U.) collects classic papers and authors' supplementary notes tackling undecidability and unsolvability. The anthology begins with Gd̲el's landmark 1931 paper arguing that formal logic systems cannot admit proofs of all true assertions of arithmetic. Church, Turing, Post, and Kleene treat recursive functions, problems from the theory of abstract computing machines, and the classification theory of unsolvable problems. Annotation 2004 Book News, Inc., Portland, OR (booknews.com)
