{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T19:12:54Z","timestamp":1693509174662},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1971,6,1]],"date-time":"1971-06-01T00:00:00Z","timestamp":44582400000},"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":15387,"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":[[1971,6]]},"DOI":"10.1016\/s0022-0000(71)80037-5","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"286-303","source":"Crossref","is-referenced-by-count":10,"title":["The enumerability and invariance of complexity classes"],"prefix":"10.1016","volume":"5","author":[{"given":"F.D.","family":"Lewis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(71)80037-5_bib1","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":"JACM"},{"key":"10.1016\/S0022-0000(71)80037-5_bib2","article-title":"Complexity Classes of Recursive Functions and the Existence of Complexity Gaps","author":"Borodin","year":"1969"},{"key":"10.1016\/S0022-0000(71)80037-5_bib3","series-title":"Tenth Ann. Sym. on Switching and Automata Theory","article-title":"Dense and Non-Dense Families of Complexity Classes","author":"Borodin","year":"1969"},{"key":"10.1016\/S0022-0000(71)80037-5_bib4","series-title":"2nd Ann. Sym. on Theory of Comp.","first-page":"1","article-title":"On the Size of Programs in Subrecursive Formalisms","author":"Constable","year":"1970"},{"key":"10.1016\/S0022-0000(71)80037-5_bib5","series-title":"Tenth Ann. Sym. on Switching and Automata Theory","article-title":"The Operator Gap","author":"Constable","year":"1969"},{"key":"10.1016\/S0022-0000(71)80037-5_bib6","doi-asserted-by":"crossref","DOI":"10.1109\/SWAT.1970.16","article-title":"On the Efficiency of Programs in Subrecursive Formalisms","author":"Constable","year":"1970"},{"key":"10.1016\/S0022-0000(71)80037-5_bib7","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(71)80037-5_bib8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","article-title":"On the computational complexity of algorithms","volume":"117","author":"Hartmanis","year":"1965","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(71)80037-5_bib9","article-title":"The Classification of Unsolvable Problems in Automata Theory","author":"Lewis","year":"1970"},{"key":"10.1016\/S0022-0000(71)80037-5_bib10","doi-asserted-by":"crossref","DOI":"10.1145\/800161.805145","article-title":"Unsolvability Considerations in Computational Complexity","author":"Lewis","year":"1970"},{"key":"10.1016\/S0022-0000(71)80037-5_bib11","unstructured":"F. D. Lewis, Classes of Recursive Functions and their Index Sets, submitted for publication."},{"key":"10.1016\/S0022-0000(71)80037-5_bib12","series-title":"ACM Sym. on Theory of Comp.","first-page":"79","article-title":"Classes of Computable Functions Defined by Bounds on Computation","author":"McCreight","year":"1969"},{"key":"10.1016\/S0022-0000(71)80037-5_bib13","series-title":"Ninth Ann. Sym. on Switching and Automata Theory","first-page":"351","article-title":"On Computational Speedup","author":"Meyer","year":"1968"},{"key":"10.1016\/S0022-0000(71)80037-5_bib14","article-title":"Linear Bounded Automata","author":"Myhill","year":"1960","journal-title":"Univ. of Penna. Rpt. No. 60-22"},{"key":"10.1016\/S0022-0000(71)80037-5_bib15","series-title":"ACM Sym. Theory of Comp.","article-title":"On Recursive Properties of Complexity Classes","author":"Landweber","year":"1970"},{"key":"10.1016\/S0022-0000(71)80037-5_bib16","first-page":"331","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"JSL"},{"key":"10.1016\/S0022-0000(71)80037-5_bib17","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(71)80037-5_bib18","series-title":"IEEE Conf. Rec. on Switching Circ. Theory and Log. Design","first-page":"179","article-title":"II. Hierarchies of Memory Limited Computations","author":"Stearns","year":"1965"},{"key":"10.1016\/S0022-0000(71)80037-5_bib19","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/321510.321525","article-title":"Toward a theory of enumerations","volume":"16","author":"Young","year":"1969","journal-title":"JACM"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000071800375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T01:11:46Z","timestamp":1559783506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000071800375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1971,6]]}},"alternative-id":["S0022000071800375"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(71)80037-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1971,6]]}}}