. .
Deutsch
Deutschland
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Buch verkaufen
Anbieter, die das Buch mit der ISBN 9780262100649 ankaufen:
Suchtools
Anmelden

Anmelden mit Facebook:

Registrieren
Passwort vergessen?


Such-Historie
Merkliste
Links zu eurobuch.com

Dieses Buch teilen auf…
Buchtipps
Aktuelles
Tipp von eurobuch.com
FILTER
- 0 Ergebnisse
Kleinster Preis: 78,84 €, größter Preis: 82,99 €, Mittelwert: 82,00 €
Computability and Complexity - Neil D. Jones
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Neil D. Jones:
Computability and Complexity - neues Buch

ISBN: 9780262100649

[ED: Buch], [PU: MIT Press Ltd], 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' -, DE, [SC: 0.00], Neuware, gewerbliches Angebot, 229x180x35 mm, 484, [GW: 1135g], offene Rechnung (Vorkasse vorbehalten), Selbstabholung und Barzahlung, PayPal, Banküberweisung, Interntationaler Versand

Neues Buch Booklooker.de
Sparbuchladen
Versandkosten:Versandkostenfrei, Versand nach Deutschland (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

[ED: Buch], [PU: MIT Press Ltd], 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', DE, [SC: 0.00], Neuware, gewerbliches Angebot, 229x180x35 mm, 484, [GW: 1135g], offene Rechnung (Vorkasse vorbehalten), Selbstabholung und Barzahlung, Banküberweisung, Interntationaler Versand

Neues Buch Booklooker.de
thon-buch.de
Versandkosten:Versandkostenfrei, Versand nach Deutschland (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 - Taschenbuch

1997, ISBN: 0262100649

ID: 22086620369

[EAN: 9780262100649], Neubuch, [PU: MIT Press Ltd Mrz 1997], Computers & the Internet|Computer Science, Computers & the Internet|Machine Theory, Computers & the Internet|Programming|General, 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

Neues Buch Abebooks.de
Agrios-Buch, Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
NEW BOOK Versandkosten:Versandkostenfrei (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

[ED: Buch], [PU: MIT Press Ltd], 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' -, [SC: 0.00], Neuware, gewerbliches Angebot, 229x180x35 mm, [GW: 1135g]

Neues Buch Booklooker.de
Sparbuchladen
Versandkosten:Versandkostenfrei (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

[ED: Buch], [PU: MIT Press Ltd], 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', [SC: 0.00], Neuware, gewerbliches Angebot, FixedPrice, [GW: 1135g]

Neues Buch Booklooker.de
Buchhandlung Kühn GmbH
Versandkosten:Versandkostenfrei (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

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

Jones, Neil

Titel:

Computability and Complexity: From a Programming Perspective

ISBN-Nummer:

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 05.06.2017 21:38:11
ISBN/EAN: 9780262100649

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


< zum Archiv...
Benachbarte Bücher