These notes are in pdf format. They are subject to
revision, as the need arises.
(c) Copyright 2009 by H. B. Enderton. All rights reserved.
Chapter 1: The Computability Concept
Chapter 2: General Recursive Functions
Chapter 3: Machines and Programs
Chapter 4: Computable Enumerability
Chapter 5: Connections to Logic (Figures)
Chapter 6: Degrees of Unsolvability
Chapter 7: Polynomial-time Computability
Appendix: Countability
Appendix: Decadic Notation