Computability, Enumerability, Unsolvability
Cambridge University Press, 1996
82,95 €On orderDelivery: 2-3 weeks
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.
- ISBN-13
- 9780521557368
- ISBN-10
- 0521557364
- Publisher
- Cambridge University Press
- Year
- 1996
- Publication date
- 1996-01-11
- Pages
- 356
- Dimensions
- 228x152x21
- Weight
- 507