The contents of this book are self-sufficient in the sense that no preliminary knowledge other than elementary set theory is needed and there are no complicated mathematical theorems in the book. A must for those entering the field.
Sample Chapter(s)
Foreword (46 KB)
Chapter 1: Computable Functions (6,297 KB)
Contents:
- Computable Functions
- S-Expressions
- Algebraic Functions and Algebraic Functionals
- The Least Fixpoint Theory
- Recursive Functions
- Computable and Listable Sets
- Computation Models
Readership: Undergraduate students in computer science.
