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