TY  - BOOK
AU  - Cooper,S.B.
AU  - Slaman,T.A.
AU  - Wainer,S.S.
TI  - Computability, Enumerability, Unsolvability: Directions in Recursion Theory 
T2  - London Mathematical Society Lecture Note Series
SN  - 9780511629167 (ebook)
AV  - QA9.6  .C66 1996
U1  - 511.3/5 20
PY  - 1996///
CY  - Cambridge
PB  - Cambridge University Press
KW  - Recursion theory
N1  - Title from publisher's bibliographic system (viewed on 16 Oct 2015)
N2  - 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
UR  - http://dx.doi.org/10.1017/CBO9780511629167
ER  -