computability introduction recursive function von nigel cutland (7 Ergebnisse)

Paperback. Zustand: Like New. FIRST THUS. First Edition Thus, First Printing. Published by Cambridge University Press, 1997. Octavo. Paperback. Book is like new with light with light edgewear. 100% positive feedback. 30 day money back guarantee. NEXT DAY SHIPPING! Excellent customer service. Please email with any questions. All books packed carefully and ship with free delivery confirmation/tracking. All books come with free bookmarks. Ships from Sag Harbor, New York.

Zustand: Good. 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.

Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. With owner's name inside cover. 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,450grams, ISBN:9780521294652.

Paperback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: New. In.

Zustand: New. This title is an introduction to computability theory covering: non-computability and undecidability; the theory of recursive and recursively enumerable sets; Gildel's incompleteness theorem; degrees of unsolvability; the recursion theorems; and the theory of complexity of computation. Num Pages: 264 pages, 24d.1tab. BIC Classification: PBC. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 234 x 167 x 16. Weight in Grams: 402. . 1980. 1st Edition. Paperback. . . . . Books ship from the US and Ireland.

Taschenbuch. Zustand: Neu. 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 some theoretical background will find this book of use and interest.