L. H. Landweber
- 1 BLUM, M. Machine independent theory of the complexity of recursive functions . J . ACM 14, 2 (April 1967), 322-336. Google Scholar
- 2 BORODIN, A. Complexity classes of recursive functions and the existence of complexity gaps. Conf. Record of ACM Syrup. on Theory of Computing, Marina del Rey, Calif., May 1969, pp. 67 78.Google Scholar
- 3 DAVIS, MARTIN. Computability and Unsolvability. McGraw-Hill, New York, 1958.Google Scholar
- 4 DEKKER, J. C. E., AND MYIfILL, J. Some theorems oil classes of recursively enmnerable sets. Tra~s. Amer. Math. Soc. 89 (Sept. 1958), 25-59.Google Scholar
- 5 HARTMANIS, J ., AND STEARNS, R .E . On the computational complexity of algorithms. Trans. Amer. Math. Soc. 117 (May 1965), 285 306.Google Scholar
- 6 LEWIS, F. I). Unsolvability considerations in computational complexity. Conf. Record of Second Annual ACM Syrup. on Theory of Computing, Northampton, Mass., May 1970, pp. 22-30. Google Scholar
- 7 MCCREIGHT, E. M., AND MEYER, A.R. Classes of computable functions defined by hounds on computation. Conf. Record of ACM Syrup. on Theory of Computing, Marina del Rey, Calif., May 1969, pp. 79-88. Google Scholar
- 8 POST, EMIL L. Recursively enumerable sets of positive integers and their decision problems. Bnll. Amer. Math. Soc. 50 (1944), 284-316.Google Scholar
- 9 RicE, H.G. Classes of recursively enumerable sets and their decision problems. Trans. Amer. Soc. 89 (March 1953), 25-59.Google Scholar
- 10 RICE, H. G. On completely recursively enumerable classes and their key arrays. J . Symbolic Logic 21, 3 (Sept. 1956), 304-341.Google Scholar
- 11 ROBERTSON, EDWARD L. Complexity classes of partial recursive functions. Conf. Record of Third Annual ACM Symp. on Theory of Computing, Shaker Heights, Ohio, May 1971, pp. 258-266. Google Scholar
- 12 RO(~ERS, H. G()del numberings of partial recursive functions. J. Symbolic Lo(lic 23, 3 (Sept. 1958), 331-341.Google Scholar
- 13 YOUNG, P .R . Toward a theory of enumerations. J. ACM 16, 2 (April 1969), 328-348. Google Scholar
- 14 YOUNG, P .R . A note OR dense and non-dense families of complexity classes. Tech. Rep. 40, Comput. Sci. I)ep., Purdue U., Lafayette, Ind., Aug. 1969.Google Scholar
- 15 McCREIGHT, E.M. Ph.D. thesis, Carnegie-Mellon U., Pittsburgh, Pa., 1969.Google Scholar
Index Terms
- Recursive Properties of Abstract Complexity Classes
Recommendations
Recursive properties of abstract complexity classes (Preliminary Version)
STOC '70: Proceedings of the second annual ACM symposium on Theory of computingIt is proven that complexity classes of abstract measures of complexity need not be recursively enumerable. However, the complement of each class is r.e.
Properties of effective enumerations of complexity classes are studied. For any measure there is ...
Complexity classes of partial recursive functions
This paper studies possible extensions of the concept of complexity class of recursive functions to partial recursive functions. Many of the well-known results for total complexity classes are shown to have corresponding, though not exactly identical, ...
Complexity classes of partial recursive functions (Preliminary Version)
STOC '71: Proceedings of the third annual ACM symposium on Theory of computingThis paper studies possible extensions of the concept of complexity class of recursive functions to partial recursive functions. Many of the well-known results for total complexity classes are shown to have corresponding, though not exactly identical, ...
Comments