ISBN10: 0521294657, ISBN13: 9780521294652, [publisher: Cambridge University Press] Softcover 251 pp., paperback, previous owner's name to half-title page, a few corners bent, MINOR underlining and marginalia to about 10 pages else good+. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.
[Cleveland, OH, U.S.A.] [Publication Year: 1988]

Cambridge University Press, Date: 1980-06-30. Paperback. Good. 1980. Cambridge University Press ISBN 0521294657 9780521294652 [US]

ISBN10: 0521294657, ISBN13: 9780521294652, [publisher: Cambridge Univ Pr] Softcover 264 pages. 9.50x6.25x0.75 inches. In Stock.
[Exeter, United Kingdom] [Publication Year: 1980]

Cambridge: Cambridge University Press, Date: 1988. Softcover. Good Condition. One or two light marks to cover. All pages unmarked and uncreased. Overall, in good used condition. ix,251. Shipped Weight: Under 500 grams. Category: Mathematics ; Recursion theory; Computable functions; Recursive functions; Name; Cutland, Nigel; ISBN: 0521294657. ISBN/EAN: 9780521294652. Add. Inventory No: 231025DHC3-4070. . 9780521294652 1988. Cambridge University Press ISBN 0521294657 9780521294652 [GB]

ISBN10: 0521294657, ISBN13: 9780521294652, [publisher: Cambridge University Press] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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 Gildel'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 ...
Show/Hide image

New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The Computability: An Introduction to Recursive Function Theory. ISBN 0521294657 9780521294652 [GB]

Cambridge Cambridge University Press 1988 Softcover Good Condition One or two light marks to cover. All pages unmarked and uncreased. Overall, in good used condition. ix, 251. Shipped Weight: Under 500 grams. Category: Mathematics; Recursion theory; Computable functions; Recursive functions; Name; Cutland, Nigel; ISBN: 0521294657. ISBN/EAN: 9780521294652. Add. Inventory No: 231025DHC3-4070.

ISBN10: 0521294657, ISBN13: 9780521294652, [publisher: CAMBRIDGE] Softcover
[DH, SE, Spain] [Publication Year: 1980]