{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:01Z","timestamp":1725460021367},"publisher-location":"Boston","reference-count":24,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_36","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"465-478","source":"Crossref","is-referenced-by-count":3,"title":["Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies"],"prefix":"10.1007","author":[{"given":"Chung-Chih","family":"Li","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors. Handbook of Logic in Computer Science. Oxford University Press, 1992. Background: Mathematical Structures."},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"issue":"1","key":"36_CR3","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321679.321691","volume":"19","author":"A. Borodin","year":"1972","unstructured":"A. Borodin. Computational complexity and the existence of complexity gaps. Journal of the ACM, 19(1):158\u2013174, 1972.","journal-title":"Journal of the ACM"},{"key":"36_CR4","volume-title":"Theory of Computation","author":"W. S. Brainerd","year":"1974","unstructured":"Walter S. Brainerd and Landweber Lawrance H. Theory of Computation. John Wiley & Sons, New York, 1974."},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/321679.321692","volume":"19","author":"R. L","year":"1972","unstructured":"Robert L. Constable. The operator gap. Journal of the ACM, 19:175\u2013183, 1972.","journal-title":"Journal of the ACM"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Stephen Cook and Alasdair Urquhart. Functional interpretation of feasibly constructive arithmetic. Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pages 107\u2013112, 1989.","DOI":"10.1145\/73007.73017"},{"key":"36_CR7","unstructured":"Martin Davis. Computability and Unsolvability. McGraw-Hill, 1958. First reprinted by Dover in 1982."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and R. E. Stearns. On the computational complexity of algorithms. Transitions of the American Mathematics Society, pages 285\u2013306, May 1965.","DOI":"10.1090\/S0002-9947-1965-0170805-7"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1137\/S0097539794263452","volume":"25","author":"B. M. Kapron","year":"1996","unstructured":"Bruce M. Kapron and Stephen A. Cook. A new characterization of type 2 feasibility. SIAM Journal on Computing, 25:117\u2013132, 1996.","journal-title":"SIAM Journal on Computing"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"L.H. Landweber and E.R. Robertson. Recursive properties of abstract complexity classes. ACM Symposium on the Theory of Complexity, May 1970.","DOI":"10.1145\/800161.805146"},{"key":"36_CR11","volume-title":"Ph.d. dissertation","author":"C.-C. Li","year":"2001","unstructured":"Chung-Chih Li. Type-2 complexity theory. Ph.d. dissertation, Syracuse University, New York, 2001."},{"key":"36_CR12","unstructured":"Chung-Chih Li and James S. Royer. On type-2 complexity classes: Preliminary report. Proceedings of the Third International Workshop on Implicit Computational Complexity, pages 123\u2013138, May 2001."},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"E. McCreight and A. R. Meyer. Classes of computable functions defined by bounds on computation. Proceedings of the First ACM Symposium on the Theory of Computing, pages 79\u201388, 1969.","DOI":"10.1145\/800169.805423"},{"key":"36_CR14","unstructured":"A. Nerode. General topology and partial recursive functionals. Talks Cornell Summ. Inst. Symb. Log., Cornell, pages 247\u2013251, 1957."},{"key":"36_CR15","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1989","unstructured":"Piergiorgio Odifreddi. Classical Recursion Theory, volume 125 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishing, North-Holland, Amsterdam, 1989."},{"key":"36_CR16","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"P. Odifreddi","year":"1999","unstructured":"Piergiorgio Odifreddi. Classical Recursion Theory, Volume II, volume 143 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishing, North-Holland, Amsterdam, 1999."},{"key":"36_CR17","unstructured":"M.O. Rabin. Degree of difficulty of computing a function and a partial ordering of recursive sets. Technical Report 2, Hebrew University, 1960."},{"key":"36_CR18","unstructured":"Hartley Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. First paperback edition published by MIT Press in 1987."},{"key":"36_CR19","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1006\/jcss.1997.1487","volume":"54","author":"J. S. Royer","year":"1997","unstructured":"James S. Royer. Semantics vs. syntax vs. computations: Machine models of type-2 polynomial-time bounded functionals. Journal of Computer and System Science, 54:424\u2013436, 1997.","journal-title":"Journal of Computer and System Science"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0168-0072(94)00026-Y","volume":"73","author":"J. I. Seiferas","year":"1995","unstructured":"Joel I. Seiferas and Albert R. Meyer. Characterization of realizable space complexities. Annals of Pure and Applied Logic, 73:171\u2013190, 1995.","journal-title":"Annals of Pure and Applied Logic"},{"key":"36_CR21","unstructured":"Anil Seth. Complexity theory of higher type functionals. Ph.d. dissertation, University of Bombay, 1994."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"D.M. Symes. The extension of machine independent computational complexity theory to oracle machine computation and the computation of finite functions. Ph.d. dissertation, University of Waterloo, Oct. 1971.","DOI":"10.1145\/800152.804911"},{"key":"36_CR23","first-page":"773","volume":"103","author":"V.A. Uspenskii","year":"1955","unstructured":"V.A. Uspenskii. On countable operations (Russian). Doklady Akademii Nauk SSSR, 103:773\u2013776, 1955.","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"2","key":"36_CR24","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1090\/S0002-9939-1973-0312768-7","volume":"37","author":"P. Young","year":"1973","unstructured":"Paul Young. Easy construction in complexity theory: Gap and speed-up theorems. Proceedings of the American Mathematical Society, 37(2):555\u2013563, February 1973.","journal-title":"Proceedings of the American Mathematical Society"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T05:11:07Z","timestamp":1627103467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_36","relation":{},"subject":[]}}