Computability and Complexity

Computability and Complexity
Author :
Publisher : MIT Press
Total Pages : 494
Release :
ISBN-10 : 0262100649
ISBN-13 : 9780262100649
Rating : 4/5 (649 Downloads)

Book Synopsis Computability and Complexity by : Neil D. Jones

Download or read book Computability and Complexity written by Neil D. Jones and published by MIT Press. This book was released on 1997 with total page 494 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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

Computability and Complexity Related Books

Computability and Complexity
Language: en
Pages: 494
Authors: Neil D. Jones
Categories: Computers
Type: BOOK - Published: 1997 - Publisher: MIT Press

GET EBOOK

Computability and complexity theory should be of central concern to practitioners as well as theorists. Unfortunately, however, the field is known for its impen
Computability and Complexity Theory
Language: en
Pages: 310
Authors: Steven Homer
Categories: Computers
Type: BOOK - Published: 2011-12-09 - Publisher: Springer Science & Business Media

GET EBOOK

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of comp
Automata, Computability and Complexity
Language: en
Pages: 1120
Authors: Elaine Rich
Categories: Computers
Type: BOOK - Published: 2008 - Publisher: Prentice Hall

GET EBOOK

For upper level courses on Automata. Combining classic theory with unique applications, this crisp narrative is supported by abundant examples and clarifies key
Computability, Complexity, and Languages
Language: en
Pages: 631
Authors: Martin Davis
Categories: Computers
Type: BOOK - Published: 1994-02-03 - Publisher: Academic Press

GET EBOOK

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. Additions to the second ed
Complexity and Real Computation
Language: en
Pages: 456
Authors: Lenore Blum
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

GET EBOOK

The classical theory of computation has its origins in the work of Goedel, Turing, Church, and Kleene and has been an extraordinarily successful framework for t