Computability, Enumerability, Unsolvability : Directions in Recursion Theory /
Edited by S. B. Cooper, T. A. Slaman, S. S. Wainer.
- Cambridge : Cambridge University Press, 1996.
- 1 online resource (356 pages) : digital, PDF file(s).
- London Mathematical Society Lecture Note Series ; no. 224 .
- London Mathematical Society Lecture Note Series ; no. 224. .
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
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.
9780511629167 (ebook)
Recursion theory
QA9.6 / .C66 1996
511.3/5
Title from publisher's bibliographic system (viewed on 16 Oct 2015).
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.
9780511629167 (ebook)
Recursion theory
QA9.6 / .C66 1996
511.3/5