Weber (mathematics, Dartmouth U.) introduces computability theory in mathematics in terms of background, defining computability, working with computable functions, computing and enumerating sets, Turing reduction and Post's problem, two hierarchies of sets, further tools and results, and areas of research. The book can be used in a course or for self-study. Annotation ©2012 Book News, Inc., Portland, OR (booknews.com)