Computability and Complexity: From a Programming Perspective (Foundations of Computing)
Language: English
Published by Mit Pr, 1997
- Hardcover
- Used
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.-OnTimeBooks-
AbeBooks seller since March 9, 2023
Condition: Used - Good
US$ 50.46
Quantity: 1 available
Add to basketItem description from seller
A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.
Seller Inventory # OTV.0262100649.G
- Title
- Computability and Complexity: From a Programming Perspective (Foundations of Computing)
- Author
- Jones, Neil D.
- Publisher
- Mit Pr
- Publication year
- 1997
- Condition
- good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0262100649
- ISBN 13
- 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 Gödel 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 on Boolean programs.
Foundations of Computing series
"Synopsis" may belong to another edition of this title.
About the Author
"About the title" may belong to another edition of this title.
-OnTimeBooks-
Phoenix, AZ, U.S.A.
AbeBooks seller since March 9, 2023
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 2 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Specialty
Used books of all typesSeller's business information
BookDrop LLC
601 S 54th Ave, STE 101
Phoenix, AZ U.S.A. 85043