- Series: London Mathematical Society Lecture Note Series (Book 224)
- Paperback: 356 pages
- Publisher: Cambridge University Press; 1 edition (January 26, 1996)
- Language: English
- ISBN-10: 0521557364
- ISBN-13: 978-0521557368
- Product Dimensions: 6 x 0.8 x 9 inches
- Shipping Weight: 1.1 pounds (View shipping rates and policies)
- Average Customer Review: 1 customer review
- Amazon Best Sellers Rank: #8,912,016 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
Computability, Enumerability, Unsolvability: Directions in Recursion Theory (London Mathematical Society Lecture Note Series) 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
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 provide a picture of current ideas and methods in the ongoing investigations into the structure of the computable and noncomputable universe. A number of the articles contain introductory and background material that will make the volume an invaluable resource for mathematicians and computer scientists.