Computability and Complexity: From a Programming Perspective (Foundations of Computing)
Language: English
Published by Mit Pr (edition ), 1997
- Hardcover
- Used
Seller: BooksRun, Philadelphia, PA, U.S.A.BooksRun
AbeBooks seller since February 2, 2016
Condition: Used - Very good
US$ 41.81
Quantity: 1 available
Add to basketItem description from seller
It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Seller Inventory # 0262100649-8-1
- Title
- Computability and Complexity: From a Programming Perspective (Foundations of Computing)
- Author
- Jones, Neil D.
- Publisher
- Mit Pr (edition )
- Publication year
- 1997
- Condition
- Very 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.
BooksRun
Philadelphia, PA, U.S.A.
AbeBooks seller since February 2, 2016
Shipping rates within U.S.A.
| Item | 3 to 8 business days | 3 to 6 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 3.99 |
Payment methods
Store description
BooksRun helps save money on books. Founded in 2014, we are an independent online bookseller with thousands of happy customers and top ratings. With millions of titles in stock, from fiction to textbooks, we have the best book selection and prices 90% below the list price. We ship all orders the same day or the next business day. Expedited shipping arrives in 2 - 5 business days. Returns are accepted within 30 days of delivery. We are committed to providing each customer with the highest standard of customer service. Please carefully check the book’s description and condition before ordering. If you have any questions or issues, please contact us first. Thank you for choosing BooksRun!…
Specialty
Сollege textbooks and trade booksSeller's business information
AZ Texts LLC
228 Park Ave S Suite 38827
New York, NY U.S.A. 10003
Terms of sale
30 days hassle-free returns guaranteed!