 |
|
|
Item Details
| Title:
|
COMPUTABILITY AND COMPLEXITY
FROM A PROGRAMMING PERSPECTIVE |
| By: |
Neil D. Jones |
| Format: |
Hardback |
| List price:
|
£7.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0262100649 |
| ISBN 13: |
9780262100649 |
| Publisher: |
MIT PRESS LTD |
| Pub. date: |
23 January, 1997 |
| Series: |
Foundations of Computing |
| Pages: |
484 |
| Description: |
The aim of this text is to build a bridge between computability and complexity theory and other areas of computer science, especially programming. It uses concepts familiar from programming languages to make computability and complexity more accessible to computer science. |
| Synopsis: |
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 |
| Publication: |
US |
| Imprint: |
MIT Press |
| Returns: |
Returnable |
|
|
|
 |
|
|
|
|
|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.
|
|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.
|
|
|
|