ABSTRACT
This chapter assigns codes to some of the elements in the operation of the basic machine. This leads to some of the most important theorems of recursion theory. The chapter begins by assigning codes to the instructions for the basic machine. An equation called the Normal Form Theorem is explained. The chapter discusses a proposition where the class of recursive functions is the smallest recursively closed class. It uses indices to extend 6.5 to partial functions. The Recursion Theorem is often useful for showing that functions are recursive.
