Computability : An Introduction to Recursive Function Theory

Rating:
Summary: An excellent book for beginners in computability theory
Review: If you are a computer scientist who would like to delve into the foundations of computing for the first time, this is the perfect book for you. The author uses unlimited register machines as his computing model, then shows equivalence with this model and other models , such as the Turing machine. The reader should find more advanced topics, such Godel's Incompleteness Theorem, the Recursion Theorem's, and Reducibility to be quite accessible.

Rating:
Summary: An excellent book for beginners in computability theory
Review: If you are a computer scientist who would like to delve into the foundations of computing for the first time, this is the perfect book for you. The author uses unlimited register machines as his computing model, then shows equivalence with this model and other models , such as the Turing machine. The reader should find more advanced topics, such Godel's Incompleteness Theorem, the Recursion Theorem's, and Reducibility to be quite accessible.