Computability, Enumerability, Unsolvability
Directions in Recursion Theory
1st Edition
Published on 26. January 2011
978-0-511-89313-1 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
College/higher education
Illustrations
Worked examples or Exercises
File size
37,41 MB
ISBN-13
978-0-511-89313-1 (9780511893131)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
S. B. Cooper | T. A. Slaman | S. S. Wainer
Computability, Enumerability, Unsolvability
Directions in Recursion Theory
Book
01/1996
Cambridge University Press
€75.10
Shipment within 15-20 days
