Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability
Directions in Recursion Theory
S. B. Cooper
, University of Leeds
T. A. Slaman , University of Chicago
S. S. Wainer , University of Leeds
T. A. Slaman , University of Chicago
S. S. Wainer , University of Leeds
January 1996
Available
Paperback
9780521557368
Looking for an inspection copy?
This title is not currently available for inspection.
£50.99
GBPPaperback
USD
eBook
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.
Product details
January 1996Paperback
9780521557368
356 pages
228 × 152 × 21 mm
0.507kg
Available
