Welcome to IOU Digital Library

A textbook presenting the theory of computation from the recursion-theoretic (computability) perspective. The book covers classical topics in computability theory including Turing machines, recursive functions, decidability, undecidability, computably enumerable sets, and degrees of unsolvability — offering a rigorous mathematical foundation for students and researchers in logic and theoretical computer science.

no reviews

245: $a: Computability Theory: An Introduction to Recursion Theory
245: $b:
082: $a:
100: $a: Herbert B. Enderton
650: $a: Recursion theory
250: $a:
440: $v:
250: $b: Academic Press (an imprint of Elsevier)
250: $c: 2011
020: $a: 978-0-12-384958=8
300: $a: 176