Computability and Complexity: From a Programming Perspective (Foundations of Computing)
Language: English
Published by Mit Pr, 1997
- Hardcover
- Used
Seller: PAPER CAVALIER UK, London, United KingdomPAPER CAVALIER UK
AbeBooks seller since January 10, 2017
Condition: Used - As new
US$ 44.70
Quantity: 1 available
Add to basketItem description from seller
Appears unread. May have a retail sticker on back cover or remainder mark on the text block.
Seller Inventory # 9780262100649-2
- Title
- Computability and Complexity: From a Programming Perspective (Foundations of Computing)
- Author
- Jones, Neil D.
- Publisher
- Mit Pr
- Publication year
- 1997
- Condition
- as new
- 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.
PAPER CAVALIER UK
London, United Kingdom
AbeBooks seller since January 10, 2017
Shipping rates from United Kingdom to U.S.A.
| Item | 7 to 21 business days | 5 to 20 business days |
|---|---|---|
| First item | US$ 7.94 | US$ 13.24 |
Payment methods
Store description
Paper Cavalier is a bookseller specialised in hard-to-find and out-of-print titles. We are based in London and New York. Looking for a book? Contact us at hello@papercavalier.com
Specialty
New titlesSeller's business information
Paper Cavalier LTD
100 Clements Road, Block K, Unit 104
London, United Kingdom SE16 4DG
Terms of sale
We guarantee the condition of every book as it is described on the Abebooks web sites. If you are dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order has not arrived, you are eligible for a refund within 30 days of the estimated delivery date. If you have changed your mind about a book that you have ordered, please use the Ask bookseller a question link to contact us and we will respond within 2 business days.
Shipping terms
Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.