What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr ...
Read More
What can computers do in principle? What are their inherent theoretical limitations? These are questions to which computer scientists must address themselves. The theoretical framework which enables such questions to be answered has been developed over the last fifty years from the idea of a computable function: intuitively a function whose values can be calculated in an effective or automatic way. This book is an introduction to computability theory (or recursion theory as it is traditionally known to mathematicians). Dr Cutland begins with a mathematical characterisation of computable functions using a simple idealised computer (a register machine); after some comparison with other characterisations, he develops the mathematical theory, including a full discussion of non-computability and undecidability, and the theory of recursive and recursively enumerable sets. The later chapters provide an introduction to more advanced topics such as G???del's incompleteness theorem, degrees of unsolvability, the Recursion theorems and the theory of complexity of computation. Computability is thus a branch of mathematics which is of relevance also to computer scientists and philosophers. Mathematics students with no prior knowledge of the subject and computer science students who wish to supplement their practical expertise with some theoretical background will find this book of use and interest.
Read Less
Add this copy of Computability: an Introduction to Recursive Function to cart. $10.41, very good condition, Sold by Reuseabook rated 4.0 out of 5 stars, ships from Gloucester, GLOS, UNITED KINGDOM, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Dispatched, from the UK, within 48 hours of ordering. Though second-hand, the book is still in very good shape. Minimal signs of usage may include very minor creasing on the cover or on the spine. Grubby book may have mild dirt or some staining, mostly on the edges of pages.
Add this copy of Computability: an Introduction to Recursive Function to cart. $14.06, very good condition, Sold by ThriftBooks-Reno rated 5.0 out of 5 stars, ships from Reno, NV, UNITED STATES, published 1980 by Cambridge University Press.
Add this copy of Computability: an Introduction to Recursive Function to cart. $14.06, good condition, Sold by ThriftBooks-Dallas rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1980 by Cambridge University Press.
Add this copy of Computability: an Introduction to Recursive Function to cart. $14.06, fair condition, Sold by ThriftBooks-Atlanta rated 5.0 out of 5 stars, ships from Austell, GA, UNITED STATES, published 1980 by Cambridge University Press.
Add this copy of Computability (an Introduction to Recursive Function to cart. $14.99, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Computability (an Introduction to Recursive Function to cart. $16.19, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Computability (an Introduction to Recursive Function to cart. $23.50, good condition, Sold by HPB-Red rated 5.0 out of 5 stars, ships from Dallas, TX, UNITED STATES, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
Add this copy of Computability: an Introduction to Recursive Function to cart. $27.51, good condition, Sold by SurplusTextSeller rated 5.0 out of 5 stars, ships from Columbia, MO, UNITED STATES, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).
Add this copy of Computability: an Introduction to Recursive Function to cart. $43.20, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1980 by Cambridge University Press.
Computability is not too elementary, but contains a lot of details about a wide range of ideas relating to the theory of computation. Great for learning about various approaches to computability, some history, decision problems, incompleteness, etc. Highly recommended for those with some background in set theory and programming!
