{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:49:44Z","timestamp":1649076584377},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"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":[[1978]]},"DOI":"10.1016\/0304-3975(78)90007-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"233-254","source":"Crossref","is-referenced-by-count":10,"title":["Some lowness properties and computational complexity sequences"],"prefix":"10.1016","volume":"6","author":[{"given":"Victor L.","family":"Bennison","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert I.","family":"Soare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(78)90007-5_bib1","series-title":"Ph.D. Dissertation","article-title":"On the computational complexity of recursively enumerable sets","author":"Bennison","year":"1976"},{"key":"10.1016\/0304-3975(78)90007-5_bib2","unstructured":"V.L. Bennison, Recursively enumerable complexity sequences and measure independence (to appear)."},{"key":"10.1016\/0304-3975(78)90007-5_bib3","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\/0304-3975(78)90007-5_bib4","author":"Blum","year":"1971","journal-title":"Subcreative sets and complexity of algorithms"},{"key":"10.1016\/0304-3975(78)90007-5_bib5","author":"Blum","year":"1975","journal-title":"On defining the complexity of partial recursive functions"},{"key":"10.1016\/0304-3975(78)90007-5_bib6","series-title":"Proc. Courant Computer Science Symp. No. 7","article-title":"Some fruitful areas for research into complexity theory","author":"Blum","year":"1973"},{"key":"10.1016\/0304-3975(78)90007-5_bib7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2307\/2271984","article-title":"On complexity properties of recursively enumerable sets","volume":"38","author":"Blum","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(78)90007-5_bib8","first-page":"12","article-title":"On effectively levelable sets","volume":"2","author":"Filotti","year":"1972","journal-title":"Recursive Function Theory Newsletter"},{"key":"10.1016\/0304-3975(78)90007-5_bib9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0022-0000(71)80007-7","article-title":"The uses of lists in the study of undecidable problems in automata theory","volume":"5","author":"Hartmanis","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(78)90007-5_bib10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.2307\/2270912","article-title":"The degrees of hyperhyperimmune sets","volume":"34","author":"Joskusch","year":"1969","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(78)90007-5_bib11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.2307\/2270328","article-title":"Degrees of recursively enumerable sets which have no maximal superset","volume":"33","author":"Lachlan","year":"1968","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(78)90007-5_bib12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2307\/1970579","article-title":"On some games which are relevant to the theory of recursively enumerable sets","volume":"91","author":"Lachlan","year":"1970","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(78)90007-5_bib13","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\/0304-3975(78)90007-5_bib14","series-title":"Ph.D. Dissertation","article-title":"Complexity properties of recursively enumerable sets","author":"Marques","year":"1973"},{"key":"10.1016\/0304-3975(78)90007-5_bib15","doi-asserted-by":"crossref","first-page":"520","DOI":"10.2307\/2271777","article-title":"On degrees of unsolvability and complexity properties","volume":"40","author":"Marques","year":"1975","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(78)90007-5_bib16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2272545","article-title":"Computational speed-up by effective operators","volume":"37","author":"Meyer","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(78)90007-5_bib17","series-title":"Ph.D. Dissertation","article-title":"Complexity theoretic properties of recursively enumerable sets","author":"Morris","year":"1974"},{"key":"10.1016\/0304-3975(78)90007-5_bib18","series-title":"Ph.D. Dissertation","article-title":"The inclusion lattice and degrees of unsolvability of the recursively enumerable sets","author":"Robinson","year":"1966"},{"key":"10.1016\/0304-3975(78)90007-5_bib19","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(78)90007-5_bib20","series-title":"Degrees of Unsolvability","author":"Schoenfield","year":"1971"},{"key":"10.1016\/0304-3975(78)90007-5_bib21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/S0002-9904-1974-13350-1","article-title":"Automorphisms of the lattice of recursively enumerable sets","volume":"80","author":"Soare","year":"1974","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(78)90007-5_bib22","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/1970842","article-title":"Automorphisms of the lattice of recursively enumerable sets. Part I: Maximal sets","volume":"100","author":"Soare","year":"1974","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(78)90007-5_bib23","unstructured":"R.I. Soare, Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets (to appear)."},{"key":"10.1016\/0304-3975(78)90007-5_bib24","doi-asserted-by":"crossref","unstructured":"R.I. Soare, Computational complexity, speedable and levelable sets, J. Symbolic Logic (to appear).","DOI":"10.2307\/2271876"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397578900075?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397578900075?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:22:41Z","timestamp":1555125761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397578900075"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0304397578900075"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(78)90007-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}