Augmented loop languages and classes of computable functions

A classification of all the computable functions is given in terms of subrecursive programming languages. These classes are those which arise from the relation “primitive recursive in”. By distinguishing between honest and dishonest classes the classification is related to the computational complexity of the functions classified and the classification has a wide degree of measure invariance. The structure of the honest and dishonest classes under inclusion is explored. It is shown that any countable partial ordering can be embedded in the dishonest classes, and that the dishonest classes are dense in the honest classes. Every honest class is minimal over some dishonest class, but there are dishonest classes with no honest class minimal over them