{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:17:25Z","timestamp":1649099845743},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,2,1]],"date-time":"1976-02-01T00:00:00Z","timestamp":191980800000},"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":13681,"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":[[1976,2]]},"DOI":"10.1016\/s0022-0000(76)80022-0","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"122-131","source":"Crossref","is-referenced-by-count":0,"title":["On computational reducibility"],"prefix":"10.1016","volume":"12","author":[{"given":"F.D.","family":"Lewis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(76)80022-0_bib1","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/S0022-0000(70)80042-3","article-title":"On the structure of subrecursive degrees","volume":"4","author":"Basu","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(76)80022-0_bib2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A 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(76)80022-0_bib3","series-title":"Tenth Annual Symposium on Switching and Automata. Theory, IEEE","article-title":"Dense and non-dense families of complexity classes","author":"Borodin","year":"1969"},{"key":"10.1016\/S0022-0000(76)80022-0_bib4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0022-0000(72)80010-2","article-title":"Degrees of computational complexity","volume":"6","author":"Enderton","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(76)80022-0_bib5","first-page":"1","article-title":"Some classes of recursive functions","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Mat."},{"key":"10.1016\/S0022-0000(76)80022-0_bib6","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1145\/321694.321702","article-title":"Recursive properties of complexity classes","volume":"19","author":"Landweber","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(76)80022-0_bib7","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/S0022-0000(72)80032-1","article-title":"Augmented loop languages and classes of computable functions","volume":"6","author":"Machtey","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(76)80022-0_bib8","series-title":"Proceedings of the ACM Symposium on the Theory of Computation","first-page":"79","article-title":"Classes of computable functions defined by bounds on computation","author":"McCreight","year":"1969"},{"key":"10.1016\/S0022-0000(76)80022-0_bib9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/malq.19720180405","article-title":"A classification of the recursive functions","volume":"18","author":"Meyer","year":"1972","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"10.1016\/S0022-0000(76)80022-0_bib10","article-title":"Degree of difficulty of computing a function and a partial ordering of recursive sets","author":"Rabin","year":"1960","journal-title":"Hebrew University Technical Report No. 2"},{"key":"10.1016\/S0022-0000(76)80022-0_bib11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1963-0158822-2","article-title":"Classes of predictably computable functions","volume":"106","author":"Ritchie","year":"1963","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(76)80022-0_bib12","doi-asserted-by":"crossref","unstructured":"R. Stearns, J. Hartmanis, and P. Lewis II, Hierarchies of memory limited computationsin \u201d1965 IEEE Conf. Rec. on Switching Circ. Theory and Log. Design,\u201c pp 179\u2013190.","DOI":"10.1109\/FOCS.1965.11"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000076800220?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:13Z","timestamp":1559797873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000076800220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,2]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,2]]}},"alternative-id":["S0022000076800220"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(76)80022-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1976,2]]}}}