Computability, Enumerability, Unsolvability
Subtitle: Directions in Recursion Theory (London Mathematical Society Lecture Note Series)
Contributors: S. B. Cooper (Editor); T. A. Slaman (Editor); S. S. Wainer (Editor)
Publisher: Cambridge University Press
Published: January 26, 1996
Language: eng
Format: Paperback
Number of pages: 355
ISBN-13: 9780521557368
Subjects: Mathematical logic; Mathematical theory of computation; Set Theory; Mathematics; Science/Mathematics; Logic; Mathematics / Combinatorics; Recursion theory
First sentence: The finite extension method is a central diagonalization technique in computability theory (see e.g. [Ro67], [Od89], [So87]).
Description: The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference.

A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.