Computability and Complexity from a Programming Perspective
by Neil D. Jones
Publisher: The MIT Press 1997
ISBN/ASIN: 0262100649
ISBN-13: 9780262100649
Number of pages: 485
Description:
The author'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. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists and more applicable to practical programming problems.
Download or read it online for free here:
Download link
(1.7MB, PDF)
Similar books
Measure-Preserving Systemsby Karl Petersen - University of North Carolina
These notes provide an introduction to the subject of measure-preserving dynamical systems, discussing the dynamical viewpoint; how and from where measure-preserving systems arise; the construction of measures and invariant measures; etc.
(10704 views)
Introduction to Complexity Theoryby Oded Goldreich
Complexity theory is the study of the intrinsic complexity of computational tasks. The book is aimed at exposing the students to the basic results and research directions in the field. The focus was on concepts, complex technical proofs were avoided.
(10655 views)
Think Complexity: Complexity Science and Computational Modelingby Allen B. Downey - Green Tea Press
This book is about complexity science, data structures and algorithms, intermediate programming in Python, and the philosophy of science. The book focuses on discrete models, which include graphs, cellular automata, and agent-based models.
(9236 views)
Complexity and Computationby Allen Downey - Green Tea Press
This book is about data structures and algorithms, intermediate programming in Python, complexity science and the philosophy of science. The book covers Graphs, Analysis of algorithms, Scale-free networks, Cellular Automata, Agent-based models, etc.
(15534 views)