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. $15.23, 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. $20.98, good condition, Sold by Goldstone Books rated 4.0 out of 5 stars, ships from Ammanford, CARMS, UNITED KINGDOM, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. All orders are dispatched within 1 working day from our UK warehouse. Established in 2004, we are dedicated to recycling unwanted books on behalf of a number of UK charities who benefit from added revenue through the sale of their books plus huge savings in waste disposal. No quibble refund if not completely satisfied.
Add this copy of Computability: an Introduction to Recursive Function to cart. $22.85, 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. $25.91, good condition, Sold by Anybook rated 4.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In good all round condition. Re-bound by library. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 550grams, ISBN: 0521294657.
Add this copy of Computability: an Introduction to Recursive Function to cart. $28.11, good condition, Sold by Anybook rated 4.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 1997 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 500grams, ISBN: 9780521294652.
Add this copy of Computability: an Introduction to Recursive Function to cart. $56.64, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Santa Clarita, CA, UNITED STATES, published 1980 by Cambridge University Press.
Add this copy of Computability: An Introduction to Recursive Function to cart. $59.53, good condition, Sold by GreatBookPricesUK5 rated 5.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Trade paperback (US). Glued binding. 264 p. Contains: Unspecified. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Add this copy of Computability: An Introduction to Recursive Function to cart. $64.33, good condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 1980 by Cambridge University Press.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Trade paperback (US). Glued binding. 264 p. Contains: Unspecified. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.
Add this copy of Computability: An Introduction to Recursive Function to cart. $66.30, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, 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!