Computability, Enumerability, Unsolvability
Directions in Recursion Theory
Published on 11. January 1996
Book
Paperback/Softback
356 pages
978-0-521-55736-8 (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
Target group
Professional and scholarly
Product notice
Paperback (trade)
Illustrations
Worked examples or Exercises
Dimensions
Height: 229 mm
Width: 152 mm
Thickness: 21 mm
Weight
578 gr
ISBN-13
978-0-521-55736-8 (9780521557368)
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
E-Book
01/2011
1st Edition
Cambridge University Press
€51.49
Available for download
Persons
Content
Minimal degrees below O' and the jump operator B. Cooper; Boolean algebras and ideals associated with the lattice of r.e. sets L. Harrington; Codable sets L. Harrington and R. Soare; Subrecursion theories A. Heaton and S. Wainer; An appraoch to lattice embaddings M. Lerman; A hierarchy of domains with totality, but without density D. Norman; Inductive inference P. Odifreddi; The discontinuity of the Slaman-Soare phenomenon X. YI; Recursive enumerability M. Arslanov; Resource bounded gereicity concepts K. Ambos-Spies; The Medvedev lattice of degrees of difficulty A. Sorbi; On the number of countable models II G. Sacks.