Classical Recursion Theory (Studies in Logic and the Foundations of Mathematics)

Summary
1988 marked the first centenary of Recursion Theory, since Dedekind's 1888 paper on the nature of number. Now available in paperback, this book is both a comprehensive reference for the subject and a textbook starting from first principles. Among the subjects covered various equivalent approaches to effective computability and their relations with computers and programming languages; a discussion of Church's thesis; a modern solution to Post's problem; global properties of Turing degrees; and a complete algebraic characterization of many-one degrees. Included are a number of applications to logic (in particular Gödel's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation.
Similar Books
-
Engineering Mechanics: Dynamics
by Russell C. Hibbeler
-
Formulas for Stress, Strain, and Structural Matrices
by Walter D. Pilkey
-
Feasible Computations and Provable Complexity Properties
by Juris Hartmanis
-
The Simplex Method: A Probabilistic Analysis
by Karl Heinz Borgwardt
-
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
by Anthony V. Fiacco
-
Logarithmic Combinatorial Structures: A Probabilistic Approach
by Richard Arratia
-
Random Generation of Trees: Random Generators in Computer Science
by Laurent Alonso
-
Interior Point Methods of Mathematical Programming
by T. Terlaky