Computability and Complexity: From a Programming Perspective (Foundations of Computing)

eBook Information

Computability and Complexity: From a Programming Perspective (Foundations of Computing) ISBN  0262100649 Release Date  15 January 1997 Category  Programming Tags  complexity,   computability,   computational complexity,   0262100649,   foundation,   complex,   perspective,   foundations,   lex,   computability and complexity theory,   autonomy computing,   computability complexity,   computability and complexity,   "computability and complexity",   computing,   complexity theory,   This book @Amazon  View Tools Google Search Web flazx.com

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 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. Other books on Programming Aptana Radrails: An Ide for Rails Development Quickstart Apache Axis2 Cocoa(R) Programming for Mac(R) OS X (3rd Edition) Code Leader: Using People, Tools, and Processes to Build Successful Software (Programmer to Programmer) SystemVerilog for Verification, Second Edition: A Guide to Learning the Testbench Language Features Microsoft Expression Web 2 On Demand GWT in Practice Special Edition Using Microsoft Expression Web 2 (Special Edition Using) A Field Guide to Genetic Programming Professional haXe and Neko Learn to Tango with D Web Component Development with Zope 3, Third Edition Genetic Programming Theory and Practice V (Genetic and Evolutionary Computation) Google Web Toolkit Applications Expert F# (Expert's Voice in .Net)