Classical recursion theory : the theory of functions and sets of natural numbers /
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 are: various equivalent app...
Saved in:
Main Authors: | |
---|---|
Corporate Authors: | |
Published: |
Elsevier,
|
Publisher Address: | Amsterdam ; New York : |
Publication Dates: | 1992. |
Literature type: | eBook |
Language: | English |
Series: |
Studies in logic and the foundations of mathematics ;
v. 125 |
Subjects: | |
Online Access: |
http://www.sciencedirect.com/science/bookseries/0049237X/125 |
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 are: 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 Go del's theorems) and to computer science, for which Recursion Theory provides the theoretical foundation. |
Item Description: | "First edition 1989"--Title page verso. |
Carrier Form: | 1 online resource (xix, 668 pages) : illustrations. |
Bibliography: | Includes bibliographical references and indexes. |
ISBN: |
9780080886596 0080886590 |
Index Number: | QA9 |
CLC: | O141.3 |
Contents: | Front Cover; Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers; Copyright Page; Foreword; Preface; Preface to the Second Edition; Contents; Introduction; Chapter I. Recursiveness and Computability; Chapter II. Basic Recursion Theory; Chapter III. Post's Problem and Strong Reducibilities; Chapter IV. Hierarchies and Weak Reducibilities; Chapter V. Turing Degrees; Chapter VI. Many-One and Other Degrees; Bibliography; Notation Index; Subject Index. |