Computability and Complexity: From a Programming Perspective (Foundations of Computing)

Valutazione media 4,5
( su 2 valutazioni fornite da Goodreads )
 
9780262100649: Computability and Complexity: From a Programming Perspective (Foundations of Computing)

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Gödel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.

According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models.

New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs.

Foundations of Computing series

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

About the Author:

Neil D. Jones is Professor of Computer Science at the University of Copenhagen.

Review:

This book has two very clear and distinct a9ms: to present the theory of computability and complexity in a different didactic way, namely as motivated by programming; and to modify notions of complexity theory so that they are more natural. As to the first aim, there is not really much literature in this direction. This places the text in the category 'highly welcome textbook for computer science students.' The second aim places this text in the category 'research monograph.' Since both parts of the book are presented well, I strongly recommend it. either section alone would be a substantial contribution.

(Henk Barendregt, Professor of Foundation of Mathematics and Computer Science, University of Nijmegen, The Netherlands)

Computability and Complexity is an introduction to the basic concepts of computability, complex, and the theory of programming languages. The author knows very well all three subjects, has made important contributions to them, has original insights and delightful personal points of view, and overall has good taste. I know of no previous book that provides a comprehensive introduction to all three subjects.

(Christos H. Papadimitriou, Professor of Computer Science, University of California, Berkeley; author of Computational Complexity)

Neil Jones is one of the precious few computer scientists with great expertise and leadership roles in both formal methods and complexity. This makes his book especially valuable.

(Yuri Gurevich, Professor of Computer Science, University of Michigan)

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

I migliori risultati di ricerca su AbeBooks

1.

Jones, Neil Deaton
Editore: The MIT Press (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 2
Da
Murray Media
(North Miami Beach, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1997. Hardcover. Condizione libro: New. Codice libro della libreria P110262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 48,32
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 2,56
In U.S.A.
Destinazione, tempi e costi

2.

Neil Deaton Jones
Editore: The MIT Press (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
Ergodebooks
(RICHMOND, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1997. Hardcover. Condizione libro: New. Codice libro della libreria DADAX0262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 50,35
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,42
In U.S.A.
Destinazione, tempi e costi

3.

Jones, Neil Deaton
Editore: The MIT Press
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
Cloud 9 Books
(Wellington, FL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press. Hardcover. Condizione libro: New. 0262100649 New Condition. Codice libro della libreria NEW6.0110444

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 61,81
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 4,28
In U.S.A.
Destinazione, tempi e costi

4.

Jones, Neil Deaton
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Quantità: > 20
Da
Paperbackshop-US
(Wood Dale, IL, U.S.A.)
Valutazione libreria
[?]

Descrizione libro 1997. HRD. Condizione libro: New. New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. Codice libro della libreria TM-9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 68,17
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,42
In U.S.A.
Destinazione, tempi e costi

5.

Neil D. Jones
Editore: MIT Press
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Quantità: > 20
Da
INDOO
(Avenel, NJ, U.S.A.)
Valutazione libreria
[?]

Descrizione libro MIT Press. Condizione libro: New. Brand New. Codice libro della libreria 0262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 68,63
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,00
In U.S.A.
Destinazione, tempi e costi

6.

Neil D. Jones
Editore: MIT Press Ltd
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 2
Da
THE SAINT BOOKSTORE
(Southport, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd. Hardback. Condizione libro: new. BRAND NEW, Computability and Complexity: From a Programming Perspective, Neil D. Jones, Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Godel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems. According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models. New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive "constant speedup" property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Foundations of Computing series. Codice libro della libreria B9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 67,97
Convertire valuta

Aggiungere al carrello

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

7.

Neil D. Jones
Editore: MIT Press Ltd, United States (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd, United States, 1997. Hardback. Condizione libro: New. Language: English . Brand New Book. Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones s goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Godel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models.New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive constant speedup property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Foundations of Computing series. Codice libro della libreria LIB9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 78,52
Convertire valuta

Aggiungere al carrello

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

8.

Neil D. Jones
Editore: MIT Press Ltd, United States (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd, United States, 1997. Hardback. Condizione libro: New. Language: English . Brand New Book. Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impenetrability. Neil Jones s goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. In a shift away from the Turing machine- and Godel number-oriented classical approaches, Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.According to Jones, the fields of computability and complexity theory, as well as programming languages and semantics, have a great deal to offer each other. Computability and complexity theory have a breadth, depth, and generality not often seen in programming languages. The programming language community, meanwhile, has a firm grasp of algorithm design, presentation, and implementation. In addition, programming languages sometimes provide computational models that are more realistic in certain crucial aspects than traditional models.New results in the book include a proof that constant time factors do matter for its programming-oriented model of computation. (In contrast, Turing machines have a counterintuitive constant speedup property: that almost any program can be made to run faster, by any amount. Its proof involves techniques irrelevant to practice.) Further results include simple characterizations in programming terms of the central complexity classes PTIME and LOGSPACE, and a new approach to complete problems for NLOGSPACE, PTIME, NPTIME, and PSPACE, uniformly based on Boolean programs. Foundations of Computing series. Codice libro della libreria LIB9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 78,99
Convertire valuta

Aggiungere al carrello

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

9.

JONES
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 10
Da
Herb Tandree Philosophy Books
(Stroud, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro 1997. Hardback. Condizione libro: NEW. 9780262100649 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Codice libro della libreria HTANDREE01290252

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 76,83
Convertire valuta

Aggiungere al carrello

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

10.

Neil Deaton Jones
Editore: The MIT Press (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Prima edizione Quantità: 1
Da
Irish Booksellers
(Rumford, ME, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press, 1997. Hardcover. Condizione libro: New. book. Codice libro della libreria 0262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 87,08
Convertire valuta

Aggiungere al carrello

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

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro