{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T07:06:12Z","timestamp":1777619172409,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,7,1]],"date-time":"1980-07-01T00:00:00Z","timestamp":331257600000},"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":12069,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,7]]},"DOI":"10.1016\/0304-3975(80)90017-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"277-301","source":"Crossref","is-referenced-by-count":42,"title":["Indexings of subrecursive classes"],"prefix":"10.1016","volume":"11","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90017-1_BIB1","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/S0022-0000(76)80008-6","article-title":"Nonexistence of program optimizers in several abstract settings","volume":"12","author":"Alton","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90017-1_BIB2","series-title":"Comp. Sci. Dept. Tech. Report 76-05","article-title":"Natural complexity measures, subrecursive languages, and speed-up","author":"Alton","year":"1976"},{"key":"10.1016\/0304-3975(80)90017-1_BIB3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativization of the P=NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0304-3975(80)90017-1_BIB4","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of the complexity of the recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90017-1_BIB5","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/321707.321721","article-title":"Subrecursive programming languages, part I: efficiency and program structure","volume":"19","author":"Constable","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90017-1_BIB6","series-title":"Combinatory Logic","author":"Curry","year":"1958"},{"key":"10.1016\/0304-3975(80)90017-1_BIB7","series-title":"Axiomatic independence of the question P=NP?","author":"Gill","year":"1972"},{"key":"10.1016\/0304-3975(80)90017-1_BIB8","series-title":"Formal Languages and their Relation to Automata","author":"Hopcroft","year":"1969"},{"key":"10.1016\/0304-3975(80)90017-1_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.4064\/cm-6-1-67-78","article-title":"Extension of an effectively generated class of functions by enumeration","volume":"6","author":"Kleene","year":"1958","journal-title":"Colloq. Math."},{"key":"10.1016\/0304-3975(80)90017-1_BIB10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90017-1_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90017-1_BIB12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0022-0000(75)80039-0","article-title":"On the density of honest subrecursive classes","volume":"10","author":"Machtey","year":"1975","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0304-3975(80)90017-1_BIB13","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/0304-3975(80)90017-1_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(76)80035-9","article-title":"Polynomial and abstract subrecursive classes","volume":"12","author":"Mehlhorn","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(80)90017-1_BIB15","first-page":"465","article-title":"The complexity of loop programs","author":"Meyer","year":"1967","journal-title":"Proc. 22nd National ACM Conference"},{"key":"10.1016\/0304-3975(80)90017-1_BIB16","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":"1953","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(80)90017-1_BIB17","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(80)90017-1_BIB18","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1147\/rd.126.0465","article-title":"Algebraically generalized recursive function theory","author":"Strong","year":"1968","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0304-3975(80)90017-1_BIB19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.2307\/2270697","article-title":"Construction of models for algebraically generalized recursive function theory","volume":"35","author":"Strong","year":"1969","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90017-1_BIB20","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0020-0255(69)90021-8","article-title":"Uniformly reflexive structures: an axiomatic approach to computability","volume":"1","author":"Wagner","year":"1969","journal-title":"Information Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900171?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900171?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:31:41Z","timestamp":1580884301000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,7]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,7]]}},"alternative-id":["0304397580900171"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90017-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,7]]}}}