Articoli correlati a Computability: An Introduction to Recursive Function...

Computability: An Introduction to Recursive Function Theory - Rilegato

 
9780521223843: Computability: An Introduction to Recursive Function Theory

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Recensione

"Dr. Cutland has produced here an excellent and much needed textbook which will undoubtedly help to establish recursion theory as a more widely taught branch of mainstream mathematics." Mathematics & Physics

Descrizione del libro

What can computers do in principle? What are their inherent theoretical limitations? 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 - a function whose values can be calculated in an automatic way. This book is an introduction to computability (recursive) theory.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Compra usato

Condizioni: buono
Former library book; may include...
Visualizza questo articolo

EUR 17,23 per la spedizione da U.S.A. a Italia

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9780521294652: Computability: An Introduction to Recursive Function Theory

Edizione in evidenza

ISBN 10:  0521294657 ISBN 13:  9780521294652
Casa editrice: Cambridge University Press, 1980
Brossura

Risultati della ricerca per Computability: An Introduction to Recursive Function...

Foto dell'editore

Cutland, N. J.
ISBN 10: 0521223849 ISBN 13: 9780521223843
Antico o usato Rilegato

Da: Better World Books, Mishawaka, IN, U.S.A.

Valutazione del venditore 5 su 5 stelle 5 stelle, Maggiori informazioni sulle valutazioni dei venditori

Condizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Codice articolo 4303327-6

Contatta il venditore

Compra usato

EUR 40,86
Convertire valuta
Spese di spedizione: EUR 17,23
Da: U.S.A. a: Italia
Destinazione, tempi e costi

Quantità: 1 disponibili

Aggiungi al carrello