. .
Français
France
Livres similaires
Autres livres qui pourraient ressembler au livre recherché:
Outils de recherche
s'inscrire

Connectez-vous avec Facebook:

S'inscrire
Mot de passe oublié?


Historique de recherche
Liste pense-bête
Liens vers eurolivre.fr

Partager ce livre sur…
Livre conseillé
Actualités
Conseils d'eurolivre.fr
Publicité
FILTRE
- 0 Résultats
prix le plus bas: 78,84 €, prix le plus élevé: 82,99 €, prix moyen: 82,00 €
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:
Computability and Complexity - nouveau livre

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

Nouveaux livres Booklooker.de
Sparbuchladen
Frais d'envoiVersandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:
Computability and Complexity - nouveau livre

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

Nouveaux livres Booklooker.de
thon-buch.de
Frais d'envoiVersandkostenfrei, Versand nach Deutschland (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:
Computability and Complexity - Livres de poche

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

Nouveaux livres Abebooks.de
Agrios-Buch, Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
NEW BOOK Frais d'envoiVersandkostenfrei (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:
Computability and Complexity - nouveau livre

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]

Nouveaux livres Booklooker.de
Sparbuchladen
Frais d'envoiVersandkostenfrei (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:
Computability and Complexity - nouveau livre

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]

Nouveaux livres Booklooker.de
Buchhandlung Kühn GmbH
Frais d'envoiVersandkostenfrei (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

Détails sur le livre
Computability and Complexity: From a Programming Perspective
Auteur:

Jones, Neil

Titre:

Computability and Complexity: From a Programming Perspective

ISBN:

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"

Informations détaillées sur le livre - Computability and Complexity: From a Programming Perspective


EAN (ISBN-13): 9780262100649
ISBN (ISBN-10): 0262100649
Version reliée
Livre de poche
Date de parution: 1997
Editeur: MIT PR
484 Pages
Poids: 1,084 kg
Langue: eng/Englisch

Livre dans la base de données depuis 24.01.2008 13:22:54
Livre trouvé récemment le 05.06.2017 21:38:11
ISBN/EAN: 9780262100649

ISBN - Autres types d'écriture:
0-262-10064-9, 978-0-262-10064-9


< pour archiver...
Livres en relation