Augmented Loop Languages and Classes of Computables 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.

[1]  A. Grzegorczyk.  Some classes of recursive functions , 1964 .

[2]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

[3]  Robert L. Constable,et al.  On the size of programs in subrecursive formalisms , 1970, STOC.

[4]  Patrick C. Fischer,et al.  Computational speed-up by effective operators , 1972, Journal of Symbolic Logic.

[5]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[6]  Leonard J. Bass,et al.  Hierarchies based on computational complexity and irregularities of class determining measured sets (Preliminary Report) , 1970, STOC '70.

[7]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[8]  Albert R. Meyer,et al.  Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.

[9]  Emil L. Post,et al.  The Upper Semi-Lattice of Degrees of Recursive Unsolvability , 1954 .

[10]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[11]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[12]  Solomon Feferman,et al.  CLASSIFICATIONS OF RECURSIVE FUNCTIONS BY MEANS OF HIERARCHIES( , 1962 .

[13]  S. C. Kleene,et al.  Extension of an effectively generated class of functions by enumeration , 1958 .

[14]  Paul Axt,et al.  On a subrecursive hierarchy and primitive recursive degrees , 1959 .

[15]  Michael Machtey,et al.  Classification of computable functions by primitive recursive classes , 1971, STOC.

[16]  J. P. Cleave,et al.  A Hierarchy of Primitive Recursive Functions , 1963 .

[17]  Allan Borodin,et al.  On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract) , 1970, SWAT.

[18]  Sanat K. Basu.  On the Structure of Subrecursive Degrees , 1970, J. Comput. Syst. Sci..