Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Computability, Enumerability, Unsolvability

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
January 2011
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Adobe eBook Reader
9780511893131
$65.99
USD
Adobe eBook Reader
GBP
Paperback

    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 2011
    Adobe eBook Reader
    9780511893131
    0 pages
    0kg
    This ISBN is for an eBook version which is distributed on our behalf by a third party.
      Editors
    • S. B. Cooper , University of Leeds
    • T. A. Slaman , University of Chicago
    • S. S. Wainer , University of Leeds