FreeComputerBooks.com
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.


 Title Computability and Complexity: From a Programming Perspective
 Author(s) Neil Deaton Jones
 Publisher: The MIT Press (January 15, 1997); eBook (Revised version, 2007)
 Hardcover 466 pages
 eBook PDF (487 pages, 1.7 MB)
 Language: English
 ISBN10: 0262100649
 ISBN13: 9780262100649
 Share This:
Book Description
This book is an introduction to the basic concepts of computability, complex, and the theory of programming languages.
This book has two very clear and distinct aims: to present the theory of computability and complexity in a different didactic way, namely as motivated by programming; and to modify notions of complexity theory so that they are more natural. As to the first aim, there is not really much literature in this direction. This places the text in the category 'highly welcome textbook for computer science students.' The second aim places this text in the category 'research monograph.' Since both parts of the book are presented well, I strongly recommend it. either section alone would be a substantial contribution.
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 numberoriented 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.
About the Authors Neil D. Jones is Professor of Computer Science at the University of Copenhagen.
 Computational Complexity
 Computer Programming
 Algorithms and Data Structures
 Computational and Algorithmic Mathematics
 Parallel Computing and Programming




















