Davis. Computability and Unsolvability
In this classic text, Dr. Davis provides a clear introduction to computability, at an advanced undergraduate level, that serves the needs of specialists and non-specialists alike.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Cooper. Computability Theory routledge.com
A concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.
-
Copeland, Posy & Shagrir (editors). Computability: Turing, Gödel, Church, and Beyond mitpress.mit.edu
Computer scientists, mathematicians, and philosophers discuss the conceptual foundations of the notion of computability as well as recent theoretical developments.
-
Philip Davis. Toward a Philosophy of Computation jstor.org
Philosophical implication of mathematization and computerization of the world.
-
Computability - An introduction to recursive function theory poincare.matf.bg.ac.rs
Nigel Cutland (University of Hull).
-
Goldreich. Computational Complexity: A Conceptual Perspective wisdom.weizmann.ac.il
A grad introduction to computation complexity theory, emphasizing the idea behind concepts of complexity theory.
-
Knuth, Graham & Patashnik. Concrete Mathematics: A Foundation for Computer Science pearson.com
An expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply.
Theoretical Computer Science › Computability Theory > Books > Introductory: “In this classic text, Dr. Davis provides a clear introduction to computability, at an advanced undergraduate level, that serves the needs of specialists and non-specialists alike.”