Computability and Complexity – From a Programming Perspective (Foundations of Computing)
Language: English
Published by MIT Press, 1997
- Hardcover
- Used
Seller: WeBuyBooks, Rossendale, LANCS, United KingdomWeBuyBooks
AbeBooks seller since November 14, 2005
Condition: Used - Good
US$ 39.97
Quantity: 1 available
Add to basketItem description from seller
Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.
Seller Inventory # rev9477440030
- Title
- Computability and Complexity – From a Programming Perspective (Foundations of Computing)
- Author
- Jones, Neil Deaton
- Publisher
- MIT Press
- Publication year
- 1997
- Condition
- Good
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0262100649
- ISBN 13
- 9780262100649
- Item weight
- 1,084.1 grams
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.
WeBuyBooks
Rossendale, LANCS, United Kingdom
AbeBooks seller since November 14, 2005
Shipping rates from United Kingdom to U.S.A.
| Item | 5 to 10 business days | 5 to 10 business days |
|---|---|---|
| First item | US$ 14.20 | US$ 14.20 |
Payment methods
Specialty
General Secondhand BooksSeller's business information
Revival Books Ltd
Unit 11 Hugh Business Park, Bacup Road, Waterfoot
Rossendale, United Kingdom BB4 7BT
Terms of sale
WeBuyBooks
Hall Carr Mill
Fallbarn Road
Rawtenstall
Lancashire BB4 7NX
Email: Sales@webuybooks.co.uk
Tel: 01706 227207
Company Reg. No. 07693718
VAT Number 901 5786 27
Authorised Representatives: Michael Lane and Damian Carr
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.