{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:13:17Z","timestamp":1725487997299},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_50","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"478-487","source":"Crossref","is-referenced-by-count":0,"title":["Speed-Up Theorems in Type-2 Computation"],"prefix":"10.1007","author":[{"given":"Chung-Chih","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","volume-title":"Background: Mathematical Structures","author":"S. Abramsky","year":"1992","unstructured":"Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.): Handbook of Logic in Computer Science. In: Background: Mathematical Structures, Oxford University Press, Oxford (1992)"},{"issue":"2","key":"50_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM\u00a014(2), 322\u2013336 (1967)","journal-title":"Journal of the ACM"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/321637.321648","volume":"18","author":"M. Blum","year":"1971","unstructured":"Blum, M.: On effective procedures for speeding up algorithms. Journal of the ACM\u00a018(2), 290\u2013305 (1971)","journal-title":"Journal of the ACM"},{"key":"50_CR4","series-title":"Number 35 in Annals of Discrete Mathematics","volume-title":"Theories of Computational Complexity","author":"C. Calude","year":"1988","unstructured":"Calude, C.: Theories of Computational Complexity. Number 35 in Annals of Discrete Mathematics. Elsevier Science Publisher, B.V., North-Holland (1988)"},{"key":"50_CR5","first-page":"51","volume-title":"Logic from Computer Science","author":"S.A. Cook","year":"1991","unstructured":"Cook, S.A.: Computability and complexity of higher type functions. In: Logic from Computer Science, pp. 51\u201372. Springer, Heidelberg (1991)"},{"key":"50_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171496","volume-title":"Computability: An introduction to recursive function theory","author":"N. Cutland","year":"1980","unstructured":"Cutland, N.: Computability: An introduction to recursive function theory. Cambridge, New York (1980)"},{"key":"50_CR7","volume-title":"The Undecidable","author":"M. Davis","year":"1965","unstructured":"Davis, M.: The Undecidable. Raven Press, New York (1965)"},{"key":"50_CR8","unstructured":"G\u00f6del, K.: \u00dcber die l\u00e4nge der beweise. Ergebnisse eines Math. Kolloquiums 7, pp. 23\u201324, Translation in [7], pp. 82\u201383, On the length of proofs (1936)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transitions of the American Mathematics Society, pp. 285\u2013306 (May 1965)","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"50_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B.M. Kapron","year":"1996","unstructured":"Kapron, B.M., Cook, S.A.: A new characterization of type 2 feasibility. SIAM Journal on Computing\u00a025, 117\u2013132 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1112\/plms\/s3-12.1.245","volume":"12","author":"S.C. Kleene","year":"1962","unstructured":"Kleene, S.C.: Turing-machine computable functionals of finite types II. Proceedings of London Mathematical Society\u00a012, 245\u2013258 (1962)","journal-title":"Proceedings of London Mathematical Society"},{"key":"50_CR12","unstructured":"Li, C.-C.: Speed-up theorems in type-2 computation (full version), http:\/\/www.itk.ilstu.edu\/faculty\/chungli\/mypapers\/SpeedUpFullVersion.pdf"},{"key":"50_CR13","doi-asserted-by":"crossref","unstructured":"Li, C.-C.: Asymptotic behaviors of type-2 algorithms and induced baire topologies. In: Proceedings of the Third International Conference on Theoretical Computer Science, pp. 471\u2013484, Toulouse, France (August 2004)","DOI":"10.1007\/1-4020-8141-3_36"},{"key":"50_CR14","unstructured":"Li, C.-C.: Clocking type-2 computation in the unit cost model. In: Proceedings of Computability in Europe: Logical Approach to Computational Barriers, pp. 182\u2013192, Swansea, UK, Report# CSR 7-2006 (2006)"},{"key":"50_CR15","unstructured":"Li, C.-C., Royer, J.S.: On type-2 complexity classes: Preliminary report, pp. 123\u2013138, (May 2001)"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2272545","volume":"37","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Fischer, P.C.: Computational speed-up by effective operators. The Journal of Symbolic Logic\u00a037, 55\u201368 (1972)","journal-title":"The Journal of Symbolic Logic"},{"key":"50_CR17","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. First paperback edition published by MIT Press in 1987, McGraw-Hill (1967)"},{"key":"50_CR18","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1006\/jcss.1997.1487","volume":"54","author":"J.S. Royer","year":"1997","unstructured":"Royer, J.S.: Semantics vs. syntax vs. computations: Machine models of type-2 polynomial-time bounded functionals. Journal of Computer and System Science\u00a054, 424\u2013436 (1997)","journal-title":"Journal of Computer and System Science"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Seiferas, J.I.: Machine-independent complexity theory. In: van Leeuwen, J (ed.), Handbook of Theoretical Computer Science, volume\u00a0A, pp. 163\u2013186. North-Holland, Elsevier Science Publisher, B.V, MIT press for paperback edition (1990)","DOI":"10.1016\/B978-0-444-88071-0.50008-4"},{"key":"50_CR20","unstructured":"Seth, A.: Complexity theory of higher type functionals. Ph.d. dissertation, University of Bombay (1994)"},{"key":"50_CR21","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"Mathematical Foundations of Computer Science 1975","author":"P. Emde Boas Van","year":"1975","unstructured":"Van Emde Boas, P.: Ten years of speed-up. In: Becvar, J. (ed.) Mathematical Foundations of Computer Science 1975. LNCS, vol.\u00a032, pp. 13\u201329. Springer, Heidelberg (1975)"},{"key":"50_CR22","volume-title":"Mathematics and its applications","author":"K. Wagner","year":"1985","unstructured":"Wagner, K., Wechsung, G.: Computational Complexity. In: Mathematics and its applications, D. Reidel Publishing Company, Dordrecht (1985)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:18:19Z","timestamp":1556713099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}