Computability, Enumerability, Unsolvability : Directions in Recursion Theory
Book Details
Format
Paperback / Softback
Book Series
London Mathematical Society Lecture Note Series
ISBN-10
0521557364
ISBN-13
9780521557368
Publisher
Cambridge University Press
Imprint
Cambridge University Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Jan 11th, 1996
Print length
356 Pages
Weight
507 grams
Dimensions
22.80 x 15.20 x 2.10 cms
Product Classification:
Mathematical logicMathematical theory of computation
Ksh 9,200.00
Manufactured on Demand
0 in stock
Delivery Location
Delivery fee: Select location
Secure
Quality
Fast
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.
Get Computability, Enumerability, Unsolvability by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Cambridge University Press and it has pages.
