Computability and Complexity by Neil D. Jones
Look inside with Google Book Preview
Computability and Complexity
By Neil D. Jones

Computability and Complexity

From a Programming Perspective

By (author) See other recent books by Neil D. Jones
Format: Hardback

Normal Price: $143.00
Your Price: $128.70 AUD, inc. GST
Shipping: $7.95 per order
You Save: $14.30! (10% off normal price)
Plus...earn $6.44 in Boomerang Bucks
Availability: Available Available to Backorder, No Due Date for Supply

Computability and Complexity by Neil D. Jones

Book Description

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 on Boolean programs. Foundations of Computing series

Buy Computability and Complexity book by Neil D. Jones from Australia's Online Bookstore, Boomerang Books.

Book Details

ISBN: 9780262100649
ISBN-10: 0262100649
Format: Hardback
(229mm x 180mm x 35mm)
Pages: 484
Imprint: MIT Press
Publisher: MIT Press Ltd
Publish Date: 3-Mar-1997
Country of Publication: United States


» Have you read this book? We'd like to know what you think about it - write a review about Computability and Complexity book by Neil D. Jones and you'll earn 50c in Boomerang Bucks loyalty dollars (you must be a member - it's free to sign up!)

Write a book review

Boomerang Bucks close

For every $20 you spend on books, you will receive $1 in Boomerang Bucks loyalty dollars. You can use your Boomerang Bucks as a credit towards a future purchase from Boomerang Books. Note that you must be a Member (free to sign up) and that conditions do apply.

Recent books by Neil D. Jones close
» close