Computability and Complexity: From a Programming Perspective

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

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

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

I migliori risultati di ricerca su AbeBooks

1.

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

Descrizione libro The MIT Press. Hardcover. Condizione libro: New. 0262100649. Codice libro della libreria Z0262100649ZN

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 10,86
Convertire valuta

Aggiungere al carrello

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

2.

Jones, Neil Deaton
Editore: The MIT Press 1997-01-15 (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
Ebooksweb COM LLC
(Bensalem, PA, U.S.A.)
Valutazione libreria
[?]

Descrizione libro The MIT Press 1997-01-15, 1997. Hardcover. Condizione libro: New. y First edition. 0262100649. Codice libro della libreria Z0262100649ZN

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 10,87
Convertire valuta

Aggiungere al carrello

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

3.

Jones, Neil Deaton
Editore: The MIT Press (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato 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 17,78
Convertire valuta

Aggiungere al carrello

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

4.

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 16,77
Convertire valuta

Aggiungere al carrello

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

5.

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 41,28
Convertire valuta

Aggiungere al carrello

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

6.

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 73,79
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,23
In 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. 237 x 185 mm. 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 80,32
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. 237 x 185 mm. 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 80,65
Convertire valuta

Aggiungere al carrello

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

9.

Neil D. Jones
Editore: MIT Press Ltd Mrz 1997 (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Buch Quantità: 1
Valutazione libreria
[?]

Descrizione libro MIT Press Ltd Mrz 1997, 1997. Buch. Condizione libro: Neu. 229x180x35 mm. Neuware - 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 onBoolean programs.'Foundations of Computing series' 484 pp. Englisch. Codice libro della libreria 9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 82,99
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 12,00
Da: Germania a: U.S.A.
Destinazione, tempi e costi

10.

Jones, Neil
Editore: Mit Pr (1997)
ISBN 10: 0262100649 ISBN 13: 9780262100649
Nuovi Rilegato Quantità: 1
Da
English-Book-Service Mannheim
(Mannheim, Germania)
Valutazione libreria
[?]

Descrizione libro Mit Pr, 1997. Condizione libro: New. Codice libro della libreria L9780262100649

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 89,72
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 6,00
Da: Germania a: U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro