{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:20:11Z","timestamp":1648671611248},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,8,1]],"date-time":"1974-08-01T00:00:00Z","timestamp":144547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14230,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,8]]},"DOI":"10.1016\/s0022-0000(74)80039-5","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"69-87","source":"Crossref","is-referenced-by-count":0,"title":["Complexity classes of partial recursive functions"],"prefix":"10.1016","volume":"9","author":[{"given":"Edward L.","family":"Robertson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80039-5_bib1","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1137\/0201020","article-title":"A note on the intersection of complexity classes of functions","volume":"1","author":"Bass","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80039-5_bib2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"Machine independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80039-5_bib3","series-title":"Proc. ACM Symp. on Theory of Computing","first-page":"67","article-title":"Computational complexity and the existance of complexity gaps","author":"Borodin","year":"1969"},{"key":"10.1016\/S0022-0000(74)80039-5_bib4","article-title":"Extending and refining heirarchies of computable functions","author":"Constable","year":"1968"},{"key":"10.1016\/S0022-0000(74)80039-5_bib5","author":"Davis","year":"1958"},{"key":"10.1016\/S0022-0000(74)80039-5_bib6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1090\/S0002-9947-1958-0097310-7","article-title":"Some theorems on classes of recursively enumerable sets","volume":"89","author":"Dekker","year":"1958","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80039-5_bib7","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/321694.321702","article-title":"Recursive properties of abstract complexity classes","volume":"19","author":"Landweber","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(74)80039-5_bib8","series-title":"Proc. 2nd ACM Symp. on Theory of Computing","first-page":"22","article-title":"Unsolvability considerations in computational complexity","author":"Lewis","year":"1970"},{"key":"10.1016\/S0022-0000(74)80039-5_bib9","series-title":"Proc. ACM Symp. on Theory of Computing","first-page":"79","article-title":"Classes of computable functions defined by bounds on computation","author":"McCreight","year":"1969"},{"key":"10.1016\/S0022-0000(74)80039-5_bib10","first-page":"183","article-title":"Nondiscernible properties of finite systems of identity relations","volume":"12","author":"Murskij","year":"1971","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0022-0000(74)80039-5_bib11","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1090\/S0002-9947-1953-0053041-6","article-title":"Classes of recursively enumerable sets and their decision problems","volume":"74","author":"Rice","year":"1954","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(74)80039-5_bib12","doi-asserted-by":"crossref","first-page":"304","DOI":"10.2307\/2269105","article-title":"On completely recursively enumerable classes and their key arrays","volume":"21","author":"Rice","year":"1956","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(74)80039-5_bib13","article-title":"Properties of Complexity Classes and Sets in Abstract Computational Complexity","author":"Robertson","year":"1970"},{"key":"10.1016\/S0022-0000(74)80039-5_bib14","author":"Rogers","year":"1970"},{"key":"10.1016\/S0022-0000(74)80039-5_bib15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.4064\/fm-41-2-203-271","article-title":"Elementary properties of Abelian groups","volume":"41","author":"Szmielew","year":"1955","journal-title":"Fund. Math."},{"key":"10.1016\/S0022-0000(74)80039-5_bib16","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(67)90401-9","article-title":"Partial algorithm problems for context free languages","volume":"11","author":"Ullian","year":"1967","journal-title":"Information and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T05:11:50Z","timestamp":1559797910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,8]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,8]]}},"alternative-id":["S0022000074800395"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80039-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,8]]}}}