{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T01:11:55Z","timestamp":1782263515564,"version":"3.54.5"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":11156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1983,1]]},"DOI":"10.1016\/s0019-9958(83)80052-7","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"100-111","source":"Crossref","is-referenced-by-count":3,"title":["Pseudo-extensions of computable functions"],"prefix":"10.1016","volume":"56","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(83)80052-7_bib1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of computational complexity","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(83)80052-7_bib2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/321637.321648","article-title":"On effective procedures for speeding up algorithms","volume":"18","author":"Blum","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(83)80052-7_bib3","article-title":"Effectively Extending the Set of Acceptable Inputs of Programs","author":"Case","year":"1973"},{"key":"10.1016\/S0019-9958(83)80052-7_bib4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.2307\/2272353","article-title":"Honest bounds for complexity classes of recursive functions","volume":"39","author":"Moll","year":"1974","journal-title":"J. Symb. Logic"},{"issue":"No. 2","key":"10.1016\/S0019-9958(83)80052-7_bib5","first-page":"10","author":"Morris","year":"1972","journal-title":"Recursive Function Theory: Newsletter"},{"key":"10.1016\/S0019-9958(83)80052-7_bib6","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"},{"key":"10.1016\/S0019-9958(83)80052-7_bib7","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800527?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995883800527?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:57Z","timestamp":1548525297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995883800527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,1]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983,1]]}},"alternative-id":["S0019995883800527"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(83)80052-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1983,1]]}}}