论文信息 - Honest bounds for complexity classes of recursive functions

Honest bounds for complexity classes of recursive functions

A new simplified proof of the McCreight-Meyer Honesty or Naming Theorem is given. Let t be a recursive function, and let F(t) be the set of recursive function computable within time bound t. Then it is shown that an honest recursive t′ can be found which is arbitrarily large on a dense set of arguments such that F(t) = F(t′).

Albert R. Meyer | Robert Moll | A. Meyer | R. Moll

[1] Robert L. Constable,et al. The Operator Gap , 1969, JACM.

[2] Juris Hartmanis,et al. An Overview of the Theory of Computational Complexity , 1971, JACM.

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

[4] Leonard Joel Bass. Hierarchies based on computational complexity and irregularities of classdetermining measured sets , 1970 .

[5] R. Constable. Upward and Downward Diagonalization over Axiomatic Complexity Classes , 1969 .

[6] Edward L. Robertson,et al. Complexity classes of partial recursive functions (Preliminary Version) , 1971, STOC.

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

[8] Allan Borodin,et al. Complexity Classes of Recursive Functions and the Existence of Complexity Gaps , 1969, Symposium on the Theory of Computing.

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

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

[11] Albert R. Meyer,et al. PROPERTIES OF BOUNDS ON COMPUTATION , 1969 .