. . All orders guaranteed and ship within 24 hours. Before placing your order for please contact us for confirmation on the book's binding. Check out our other listings to add to your order for discounted shipping. Seller Inventory # BOS-T-11i-01402

Contact seller

Report this item

Bibliographic Details

Title: Computability and Complexity: From a ...

Publisher: Mit Pr

Publication Date: 1997

Binding: Hardcover

Condition: Very Good

About this title

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 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

About the Author:

Neil D. Jones is Professor of Computer Science at the University of Copenhagen.

"About this title" may belong to another edition of this title.

Store Description

More Than Words (MTW) is a social enterprise that empowers youth who are in the foster care system, court involved, homeless, or out of school to take charge of their lives by taking charge of a business. By working as a team to manage their own retail and online used book business, caf�, and community space, youth develop the employment skills, leadership, and self-confidence they need to successfully transition to adulthood.

Visit Seller's Storefront

Seller's business information

More Than Words
376 Moody Street, Waltham, MA, 02453, U.S.A.

Terms of Sale:

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�re dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn�t arrived, you�re eligible for a refund within 30 days of the estimated delivery date. If you�ve changed your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us and we�ll 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.

Payment Methods
accepted by seller

Add to Wants

Items related to Computability and Complexity: From a Programming Perspective...

Computability and Complexity: From a Programming Perspective (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES)

Jones, Neil D.

Used - Hardcover

Seller's business information