Produktart
Zustand
Einband
Weitere Eigenschaften
Land des Verkäufers
Verkäuferbewertung
Verlag: Cambridge University Press, 1980
ISBN 10: 0521294657ISBN 13: 9780521294652
Anbieter: WorldofBooks, Goring-By-Sea, WS, Vereinigtes Königreich
Buch
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.
Verlag: Cambridge University Press, 1984
ISBN 10: 0521294657ISBN 13: 9780521294652
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Buch
Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Clean from markings. 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:0521294657.
Verlag: Cambridge University Press, 1980
ISBN 10: 0521294657ISBN 13: 9780521294652
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch
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.