. .
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: 42,35 €, prix le plus élevé: 77,95 €, prix moyen: 63,85 €
Computability and Complexity - Neil D. Jones
Livre non disponible
(*)
Neil D. Jones:

Computability and Complexity - nouveau livre

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

Nouveaux livres Buch.de
Nr. 5102837 Frais d'envoiBü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...
(*) 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

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

Nouveaux livres Thalia.de
No. 5102837 Frais d'envoi, Versandfertig in 1 - 2 Wochen, DE (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 - Jones, Neil D.
Livre non disponible
(*)
Jones, Neil D.:
Computability and Complexity - edition reliée, livre de poche

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

Nouveaux livres Booklooker.de
buecher.de GmbH & Co. KG
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: From a Programming Perspective - Neil Deaton Jones
Livre non disponible
(*)
Neil Deaton Jones:
Computability and Complexity: From a Programming Perspective - edition reliée, livre de poche

ISBN: 9780262100649

ID: 9780262100649

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

Nouveaux livres Barnesandnoble.com
new Frais d'envoi 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 - edition reliée, livre de poche

1997, ISBN: 9780262100649

ID: 352408

Hardcover, Buch, [PU: MIT Press]

Nouveaux livres Lehmanns.de
Frais d'envoiVersand in 10-15 Tagen, , Versandkostenfrei innerhalb der BRD (EUR 0.00)
Details...
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.

< Retour aux résultats de 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:

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"

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 09.09.2016 10:40:31
ISBN/EAN: 9780262100649

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

< Retour aux résultats de recherche...
< pour archiver...
Livres en relation