. .
Deutsch
Deutschland
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.com

Dieses Buch teilen auf…
Buchtipps
Aktuelles
Get it on iTunesJetzt bei Google Play
Tipp von eurobuch.com
FILTER
- 0 Ergebnisse
Kleinster Preis: 42,35 €, größter Preis: 77,95 €, Mittelwert: 63,85 €
Computability and Complexity - Neil D. Jones
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Neil D. Jones:

Computability and Complexity - neues Buch

ISBN: 9780262100649

ID: 85f66bb5d369a7adc7d66bc6f61a96d3

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 onBoolean programs."Foundations of Computing series" Bücher / Fremdsprachige Bücher / Englische Bücher 978-0-262-10064-9, MIT Press Ltd

Neues Buch Buch.de
Nr. 5102837 Versandkosten:Bücher und alle Bestellungen die ein Buch enthalten sind versandkostenfrei, sonstige Bestellungen innerhalb Deutschland EUR 3,-, ab EUR 20,- kostenlos, Bürobedarf EUR 4,50, kostenlos ab EUR 45,-, Versandfertig in 1 - 2 Wochen, DE. (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Computability and Complexity - Neil D. Jones
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)

Neil D. Jones:

Computability and Complexity - neues Buch

ISBN: 9780262100649

ID: 224086656

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 From a Programming Perspective Buch (fremdspr.) Bücher>Fremdsprachige Bücher>Englische Bücher, MIT Press Ltd

Neues Buch Thalia.de
No. 5102837 Versandkosten:, Versandfertig in 1 - 2 Wochen, DE (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Computability and Complexity - Jones, Neil D.
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Jones, Neil D.:
Computability and Complexity - gebunden oder broschiert

ISBN: 9780262100649

[ED: Hardcover], [PU: MIT Press Ltd], 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"25Versandfertig in über 4 Wochen, [SC: 0.00], Neuware, gewerbliches Angebot

Neues Buch Booklooker.de
buecher.de GmbH & Co. KG
Versandkosten:Versandkostenfrei (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Computability and Complexity: From a Programming Perspective - Neil Deaton Jones
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Neil Deaton Jones:
Computability and Complexity: From a Programming Perspective - gebunden oder broschiert

ISBN: 9780262100649

ID: 9780262100649

Computability and Complexity: From a Programming Perspective Computability-and-Complexity~~Neil-Deaton-Jones Computers>Windows>Programming Hardcover, MIT Press

Neues Buch Barnesandnoble.com
new Versandkosten: EUR 0.00
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Computability and Complexity - Neil D. Jones
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Neil D. Jones:
Computability and Complexity - gebunden oder broschiert

1997, ISBN: 9780262100649

ID: 352408

Hardcover, Buch, [PU: MIT Press]

Neues Buch Lehmanns.de
Versandkosten:Versand in 10-15 Tagen, , Versandkostenfrei innerhalb der BRD (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

< zum Suchergebnis...
Details zum Buch
Computability and Complexity: From a Programming Perspective
Autor:

Jones, Neil

Titel:

Computability and Complexity: From a Programming Perspective

ISBN-Nummer:

9780262100649

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"

Detailangaben zum Buch - Computability and Complexity: From a Programming Perspective


EAN (ISBN-13): 9780262100649
ISBN (ISBN-10): 0262100649
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1997
Herausgeber: MIT PR
484 Seiten
Gewicht: 1,084 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 24.01.2008 13:22:54
Buch zuletzt gefunden am 09.09.2016 10:40:31
ISBN/EAN: 9780262100649

ISBN - alternative Schreibweisen:
0-262-10064-9, 978-0-262-10064-9

< zum Suchergebnis...
< zum Archiv...
Benachbarte Bücher