Computability: An Introduction to Recursive Function Theory

Valutazione media 3,93
( su 14 valutazioni fornite da Goodreads )
 
9780521294652: Computability: An Introduction to Recursive Function Theory

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.

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

Book Description:

This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.

Review:

"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

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

I migliori risultati di ricerca su AbeBooks

1.

Nigel J. Cutland
Editore: CAMBRIDGE UNIVERSITY PRESS, United Kingdom (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Paperback Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 1980. Paperback. Condizione libro: New. Language: English . Brand New Book. 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. Codice libro della libreria AAU9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 41,89
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

2.

Nigel Cutland
Editore: Cambridge University Press 1980-06-19, Cambridge (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi paperback Quantità: > 20
Da
Blackwell's
(Oxford, OX, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press 1980-06-19, Cambridge, 1980. paperback. Condizione libro: New. Codice libro della libreria 9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 41,90
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,39
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

3.

Nigel J. Cutland
Editore: CAMBRIDGE UNIVERSITY PRESS, United Kingdom (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Paperback Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 1980. Paperback. Condizione libro: New. Language: English . Brand New Book. 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. Codice libro della libreria AAU9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 46,66
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

4.

Cutland, Nigel J.
Editore: Cambridge University Press (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Brossura Prima edizione Quantità: 1
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 1980. Condizione libro: 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. . . . . . Codice libro della libreria V9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 47,99
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Irlanda a: U.S.A.
Destinazione, tempi e costi

5.

Cutland, Nigel J.
Editore: Cambridge University Press 1980-06 (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Quantità: 5
Print on Demand
Da
Chiron Media
(Wallingford, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press 1980-06, 1980. Condizione libro: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. Codice libro della libreria NU-LSI-06850463

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 46,09
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,38
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

6.

Nigel Cutland
Editore: Cambridge University Press (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Brossura Quantità: 1
Da
Ria Christie Collections
(Uxbridge, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 1980. Condizione libro: New. book. Codice libro della libreria ria9780521294652_rkm

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 45,57
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 4,37
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

7.

Cutland, Nigel J.
Editore: Cambridge University Press
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Brossura Quantità: 1
Da
Kennys Bookstore
(Olney, MD, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press. Condizione libro: 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. Codice libro della libreria V9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 50,82
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

8.

Nigel Cutland
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Quantità: 1
Da
BWB
(Valley Stream, NY, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Depending on your location, this item may ship from the US or UK. Codice libro della libreria 97805212946520000000

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 52,31
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

9.

Nigel J. Cutland
Editore: Cambridge University Press
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Paperback Quantità: 5
Print on Demand
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press. Paperback. Condizione libro: new. BRAND NEW PRINT ON DEMAND., Computability: An Introduction to Recursive Function Theory, Nigel J. Cutland, 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. Codice libro della libreria B9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 44,52
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 7,86
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

10.

Cutland, Nigel
Editore: Cambridge University Press (1980)
ISBN 10: 0521294657 ISBN 13: 9780521294652
Nuovi Quantità: 1
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro Cambridge University Press, 1980. PAP. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria BB-9780521294652

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 42,22
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,18
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro