Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Download BookComputability, Enumerability, Unsolvability : Directions in Recursion Theory
PDF
by Cooper, S. B.; Slaman, T. A.; Wainer, S. S.; Wainer, S. S.
Information
Format: PDFLanguage: EnglishPublisher: Cambridge University PressPublication Date of the Electronic Edition: 1996
?
ISBN: 9780521557368, 9781107369603
$5$1Discount Coupon
Delivery time: Maximum 24 hours
Description
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.
$5$1Discount Coupon
Delivery time: Maximum 24 hours
Offline Request
If your request can be solved, it will be priced. After receiving your payment, we will proceed your order.