Tell your friends about this item:
Computability, Enumerability, Unsolvability: Directions in Recursion Theory - London Mathematical Society Lecture Note Series S B Cooper
Computability, Enumerability, Unsolvability: Directions in Recursion Theory - London Mathematical Society Lecture Note Series
S B Cooper
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.
356 pages, Illustrations
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | January 11, 1996 |
| ISBN13 | 9780521557368 |
| Publishers | Cambridge University Press |
| Pages | 356 |
| Dimensions | 152 × 228 × 21 mm · 507 g |
| Language | English |
| Editor | Cooper, S. B. (University of Leeds) |
| Editor | Slaman, T. A. (University of Chicago) |
| Editor | Wainer, S. S. (University of Leeds) |