ACM Home Page
Please provide us with feedback. Feedback
The Operator Gap
Full text PdfPdf (551 KB)
Source Journal of the ACM (JACM) archive
Volume 19 ,  Issue 1  (January 1972) table of contents
Pages: 175 - 183  
Year of Publication: 1972
ISSN:0004-5411
Author
Robert L. Constable  Cornell University, Computer Science Department, Ithaca, New York
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321679.321692
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
BORODIN, A. Complexity classes of recursive functions and the existence of complexity gaps. ACM Symposium on the Theory of Computing, Marina Del Rey, Calif., 1969, pp. 67-78.
 
3
HELM, J.P. On effectively computable operators. Comp. Sci. Dep. Tech. Rep. 49, Purdue U., Lafayette, Ind., 1970.
 
4
KLEENE, S.S. Introduction to Metamathematics. Princeton U. Press, Princeton, N.J., 1952.
5
 
6
 
7
ROGERS, H. GSdel numberings of partial recursive functions. J. Symb. Logic 22, 3 (1958), 331-341.
8


Collaborative Colleagues:
Robert L. Constable: colleagues

Peer to Peer - Readers of this Article have also read: