{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:30:59Z","timestamp":1768260659313,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":6894,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)00050-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"387-394","source":"Crossref","is-referenced-by-count":4,"title":["On recursive bounds for the exceptional values in speed-up"],"prefix":"10.1016","volume":"132","author":[{"given":"Douglas","family":"Bridges","sequence":"first","affiliation":[]},{"given":"Cristian","family":"Calude","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(94)00050-6_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":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(94)00050-6_bib2","first-page":"257","article-title":"On effective procedures for speeding up algorithms","volume":"18","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00050-6_bib3","author":"Blum","year":"1993","journal-title":"Private email communication to Douglas Bridges"},{"key":"10.1016\/0304-3975(94)00050-6_bib4","article-title":"Computability: A Mathematical Sketchbook","volume":"Vol. 146","author":"Bridges","year":"1994"},{"key":"10.1016\/0304-3975(94)00050-6_bib5","series-title":"Theories of Computational Complexity","author":"Calude","year":"1988"},{"key":"10.1016\/0304-3975(94)00050-6_bib6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/malq.19920380112","article-title":"Recursive Baire classification and speedable functions","volume":"38","author":"Calude","year":"1992","journal-title":"Z. Math. Logik Grundlagen der Math."},{"key":"10.1016\/0304-3975(94)00050-6_bib7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/0022-0000(90)90006-7","article-title":"A note on a.e. h-complex functions","volume":"40","author":"Fulk","year":"1990","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(94)00050-6_bib8","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00050-6_bib9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2271512","article-title":"On size vs. efficiency for programs admitting speed-ups","volume":"36","author":"Helm","year":"1971","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)00050-6_bib10","series-title":"An Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(94)00050-6_bib11","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"issue":"1","key":"10.1016\/0304-3975(94)00050-6_bib12","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(94)00050-6_bib13","series-title":"Computation and Automata","author":"Salomaa","year":"1985"},{"key":"10.1016\/0304-3975(94)00050-6_bib14","first-page":"585","article-title":"Does the computational speed-up concern programming?","author":"Schnorr","year":"1972"},{"key":"10.1016\/0304-3975(94)00050-6_bib15","series-title":"Rekursive Funktionen und ihre Komplexit\u00e4t","author":"Schnorr","year":"1974"},{"key":"10.1016\/0304-3975(94)00050-6_bib16","first-page":"165","article-title":"Machine-independent complexity theory","author":"Seiferas","year":"1990"},{"key":"10.1016\/0304-3975(94)00050-6_bib17","article-title":"Theory of Formal Systems","volume":"Vol. 47","author":"Smullyan","year":"1961","journal-title":"Annals of Mathematics Studies"},{"key":"10.1016\/0304-3975(94)00050-6_bib18","series-title":"Proc. 4th Symp. Math. Found. of Comp. Sci.","first-page":"232","article-title":"Ten years of speed-up","volume":"Vol. 32","author":"van Emde Boas","year":"1975"},{"key":"10.1016\/0304-3975(94)00050-6_bib19","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1090\/S0002-9939-1973-0312768-7","article-title":"Easy constructions in complexity theory: gap and speed-up theorems","volume":"37","author":"Young","year":"1973","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000506?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000506?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T20:38:40Z","timestamp":1583872720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594000506"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00050-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}