×

Computability and unsolvability. (Enl. version of the orig. publ. McGraw- Hill Book Company, New York 1958). (English) Zbl 0553.03024

New York: Dover Publications, Inc. XXV, 248 p. (1982).
For a review of the first edition (1958) see Zbl 0080.009. - The present edition has been completed by the author’s paper ”Hilbert’s tenth problem is unsolvable” [Am. Math. Mon. 80, 233-269 (1973; Zbl 0277.02008)], referring to work of Matiyasevich and thus updating the exposition of chapter 7 on Diophantine equations.

MSC:

03Dxx Computability and recursion theory
03-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations
03-02 Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
03D20 Recursive functions and relations, subrecursive hierarchies
03D10 Turing machines and related notions
03D35 Undecidability and degrees of sets of sentences
03D03 Thue and Post systems, etc.
03D40 Word problems, etc. in computability and recursion theory
11D99 Diophantine equations
03D55 Hierarchies of computability and definability
03D25 Recursively (computably) enumerable sets and degrees
03D30 Other degrees and reducibilities in computability and recursion theory
03D80 Applications of computability and recursion theory