Detailseite wird geladen...
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
Buch.de
Nr. 5102837 Shipping costs: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... |
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
Thalia.de
No. 5102837 Shipping costs:, Versandfertig in 1 - 2 Wochen, DE (EUR 0.00)
Details... |
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
Booklooker.de |
ISBN: 9780262100649
ID: 9780262100649
Computability and Complexity: From a Programming Perspective Computability-and-Complexity~~Neil-Deaton-Jones Computers>Windows>Programming Hardcover, MIT Press
Barnesandnoble.com
new Shipping costs: EUR 0.00
Details... |
Lehmanns.de
Shipping costs:Versand in 10-15 Tagen, , Versandkostenfrei innerhalb der BRD (EUR 0.00)
Details... |
Author: | |
Title: | Computability and Complexity: From a Programming Perspective |
ISBN: | 9780262100649 |
Details of the book - Computability and Complexity: From a Programming Perspective
EAN (ISBN-13): 9780262100649
ISBN (ISBN-10): 0262100649
Hardcover
Paperback
Publishing year: 1997
Publisher: MIT PR
484 Pages
Weight: 1,084 kg
Language: eng/Englisch
Book in our database since 24.01.2008 13:22:54
Book found last time on 09.09.2016 10:40:31
ISBN/EAN: 9780262100649
ISBN - alternate spelling:
0-262-10064-9, 978-0-262-10064-9
< to archive...
Nearby books
- "Welfare - Vol. 2: Measuring Social Welfare", from "Jorgenson, Dale Weldeau" (0262100630)
- "Advances in Neural Information Processing Systems 9", from "Michael Irwin Jordan, Thomas Petsche, Michael C. Mozer" (0262100657)
- "Welfare - Vol. 1: Aggregate Consumer Behavior", from "Jorgenson, Dale Weldeau" (0262100622)
- "Statistical Methods for Speech Recognition", from "Jelinek, Frederick; Jelinek" (0262100665)
- "international law and international relations" (0262100614)
- "Infinite Regress: Marcel Duchamp 1910-1941", from "Joselit, David" (0262100673)