Computability, Enumerability, Unsolvability
Computability, Enumerability, Unsolvability
T. A. Slaman , University of Chicago
S. S. Wainer , University of Leeds
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
$70.00
USDThe 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 2011Adobe eBook Reader
9780511893131
0 pages
0kg
This ISBN is for an eBook version which is distributed on our behalf by a third party.
