{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T13:01:34Z","timestamp":1705064494980},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1975,4,1]],"date-time":"1975-04-01T00:00:00Z","timestamp":165542400000},"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":13987,"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":[[1975,4]]},"DOI":"10.1016\/s0022-0000(75)80039-0","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T09:46:40Z","timestamp":1289382400000},"page":"183-199","source":"Crossref","is-referenced-by-count":21,"title":["On the density of honest subrecursive classes"],"prefix":"10.1016","volume":"10","author":[{"given":"Michael","family":"Machtey","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80039-0_bib1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1090\/S0002-9947-1959-0126377-3","article-title":"On a subrecursive hierarchy and primitive recursive degrees","volume":"92","author":"Axt","year":"1959","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(75)80039-0_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(75)80039-0_bib3","series-title":"Proc. 1964 Intern. Cong. Logic, Methodology, and Phil. Science","first-page":"24","article-title":"The intrinsic computational difficulty of functions","author":"Cobham","year":"1964"},{"key":"10.1016\/S0022-0000(75)80039-0_bib4","first-page":"1","article-title":"Some classes of recursive functions","author":"Grzegorczyk","year":"1953","journal-title":"Rozprawy Matematcyzne"},{"key":"10.1016\/S0022-0000(75)80039-0_bib5","author":"Hopcroft","year":"1969"},{"key":"10.1016\/S0022-0000(75)80039-0_bib6","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(75)80039-0_bib7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0019-9958(74)80039-2","article-title":"The honest subrecursive classes are a lattice","volume":"24","author":"Machtey","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/S0022-0000(75)80039-0_bib8","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(75)80039-0_bib9","first-page":"117","article-title":"\u00dcber gewisse universelle Relationen, Polskiego Tow","volume":"17","author":"Mostowski","year":"1938","journal-title":"Matematycznego"},{"key":"10.1016\/S0022-0000(75)80039-0_bib10","author":"P\u00e9ter","year":"1967"},{"key":"10.1016\/S0022-0000(75)80039-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(75)80039-0_bib12","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(75)80039-0_bib13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T23:54:59Z","timestamp":1544140499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1975,4]]}},"alternative-id":["S0022000075800390"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80039-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,4]]}}}