Indexings of Subrecursive Classes

Abstract A subrecursive indexing is a programming language or Godel numbering for a class of total recursive functions. Several properties of subrecursive indexings, such as effective composition and generation of constant functions, are investigated from an axiomatic point of view. The result is a theory akin to the axiomatic treatment of recursive function theory of Strong and Wagner. Using this formalism, we prove results relating the complexity of uniform simulation, diagonalization, deciding membership, and deciding halting; we give a subrecursive analog of Rice's theorem; we give a characterization of the combinatorial power of subrecursive indexings analogous to the combinatorial completeness of the lambda calculus; finally, we give a characterization the power of diagonalization over subrecursive classes and show that if P≠NP is provable at all, then it is provable by diagonalization.

[1]  Kurt Mehlhorn,et al.  Polynomial and abstract subrecursive classes , 1974, STOC '74.

[2]  Kurt Mehlhorn.  Polynomial and Abstract Subrecursive Classes , 1976, J. Comput. Syst. Sci..

[3]  H. R. Strong.  Algebraically generalized recursive function theory , 1968 .

[4]  Michael Machtey.  On the Density of Honest Subrecursive Classes , 1975, J. Comput. Syst. Sci..

[5]  Allan Borodin,et al.  Subrecursive Programming Languages, Part I: efficiency and program structure , 1972, JACM.

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

[7]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[8]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

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

[10]  H. Raymond Strong.  Construction of Models for Algebraically Generalized Recursive Function Theory , 1970, J. Symb. Log..

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

[12]  Donald A. Alton,et al.  Nonexistence of Program Optimizers in Several Abstract Settings , 1976, J. Comput. Syst. Sci..

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

[14]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[15]  H. Rice.  Classes of recursively enumerable sets and their decision problems , 1953 .

[16]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[17]  Eric G. Wagner.  Uniformly reflexive structures: An axiomatic approach to computability , 1969, Inf. Sci..

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