论文信息 - The Honest Subrecursive Classes Are a Lattice

The Honest Subrecursive Classes Are a Lattice

The relation of honest subrecursive classes to the computational complexity of the functions they contain is reviewed. It is shown that the honest subrecursive classes are a distributive lattice under the partial ordering of set inclusion. The meet and join operations of the lattice are effective, and every honest subrecursive class is the greatest lower bound of two setwise incomparable honest subrecursive classes.

Michael Machtey

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

[2] Yehoshua Bar-Hillel,et al. The Intrinsic Computational Difficulty of Functions , 1969 .

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

[4] Michael Machtey,et al. Augmented Loop Languages and Classes of Computables Functions , 1972, J. Comput. Syst. Sci..

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

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

[7] Martin D. Davis,et al. Computability and Unsolvability , 1959, McGraw-Hill Series in Information Processing and Computers.

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

[9] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[10] Dennis M. Ritchie,et al. A Classification of the Recursive Functions , 1972 .

[11] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[12] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .