Computability - An introduction to recursive function theory
Nigel Cutland (University of Hull).
- from
- Math
- added
- 2026-10-10
- likes
- 0
similar
-
Cutland. Computability: An Introduction to Recursive Function Theory cambridge.org
Intuitively, It explains the idea of a computable function: a function whose values can be calculated in an effective or automatic way.
-
Cooper. Computability Theory routledge.com
A concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results.
-
Odifreddi. Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers archive.org
An impressive presentation of classical recursion theory. It is highly recommended to everyone interested in recursion theory.
-
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.
-
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.
-
Paluszynski. Calculus for Computer Scientists math.uni.wroc.pl
calculus lecture notes taught for undergrad computer science students
Math › Foundations and Logic > Logic: “Nigel Cutland (University of Hull).”