论文信息 - Unsolvability considerations in computational complexity

Unsolvability considerations in computational complexity

The study of Computational Complexity began with the investigation of Turing machine computations with limits on the amounts of tape or time which could be used. Latter a set of general axioms for measures of resource limiting was presented and this instigated much study of the properties of these general measures. Many interesting results were shown, but the general axioms allowed measures with undesirable properties and many attempts have been made to tighten up the axioms so that only desirable measures will be defined. In this paper several undecidability aspects of complexity classes and several sets associated with them will be examined. These sets will be classified by their degree of unsolvability and restrictions will be placed on measures so that these degrees are identical. This gives rise to a new criterion for the “naturalness” of measures and to suggestions for strengthening the measures of complexity.

Forbes D. Lewis | F. D. Lewis

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

[2] J. Dekker,et al. Some theorems on classes of recursively enumerable sets , 1958 .

[3] Richard Edwin Stearns,et al. Hierarchies of memory limited computations , 1965, SWCT.

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

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

[6] Allan Borodin,et al. Dense and Non-Dense Families of Complexity Classes , 1969, SWAT.

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

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

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

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

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

[12] Paul R. Young,et al. Toward a Theory of Enumerations , 1968, JACM.