You might also like

More about Computability, Enumerability, Unsolvability

• Book details
• Synopsis
• Trending among others

You get 173 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Mathematical foundations

• Full title: Computability, Enumerability, Unsolvability
• Subtitle: Directions in Recursion Theory
• Author: S. B. Cooper, T. A. Slaman, Stanley S. Wainer
• Language: English
• Binding: Paperback
• Number of pages: 356
• EAN: 9780521557368
• ISBN: 0521557364
• ID: 02035086
• Publisher: Cambridge University Press
• Weight: 507 g
• Dimensions: 229 × 152 × 20 mm
• Date of publishing: 11. January 1996

Trending among others

---

---

---