Computability, Enumerability, Unsolvability

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,...

• Format: Paperback
• Language: English
• ISBN: 0521557364
• ISBN13: 9780521557368
• Release Date: January 1996
• Publisher: Cambridge University Press
• Length: 356 Pages
• Weight: 1.13 lbs.
• Dimensions: 0.8" x 6.0" x 9.0"