Cutland. Computability: An Introduction to Recursive Function Theory
Intuitively, It explains the idea of a computable function: a function whose values can be calculated in an effective or automatic way.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Computability - An introduction to recursive function theory poincare.matf.bg.ac.rs
Nigel Cutland (University of Hull).
-
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.
-
Eck & Critchlow. Foundations of Computation math.hws.edu
for a one-semester course in theoretical computer science. It has no prerequisites other than introductory computer programming. It includes logic, sets, and function from discrete math, and automata, formal languages, and grammar from upper-level courses.
-
Davis. Computability and Unsolvability amazon.com
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.
-
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.
Theoretical Computer Science › Computability Theory > Books > Introductory: “Intuitively, It explains the idea of a computable function: a function whose values can be calculated in an effective or automatic way.”