Opening book details…
Can I read Computability and Complexity: From a Programming Perspective on EtoBox?
Computability and Complexity: From a Programming Perspective by Jones N. is a nonfiction available to read on EtoBox.
What is Computability and Complexity: From a Programming Perspective about?
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
Who reads Computability and Complexity: From a Programming Perspective?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Jones N.
- Published
- 1997
- Language
- EN
- Category
- nonfiction
- Subjects
- Computer Science, Programming, Stem
More by Jones N.
Similar books
- Computability and Complexity: From a Programming Perspective (Foundations of Computing) (FOUNDATIONS OF COMPUTING SERIES) — Neil Deaton Jones (1997)
- Computability and Complexity Theory (Texts in Computer Science) — Alan L. Selman Steven Homer (2011)
- Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Applied Mathematics) — Martin D. Davis; Elaine J. Weyuker; Werner Rheinboldt (1983)
- Algorithmic Randomness and Complexity (Theory and Applications of Computability Book 0) — Rodney G. Downey, Denis R. Hirschfeldt (auth.) (2010)
- Computability and Complexity — Hubie Chen (2023)
- Handbook of Computability and Complexity in Analysis (Theory and Applications of Computability) — Peter Hertling Vasco Brattka (2021)