{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:23Z","timestamp":1759638983127},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_31","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:35:33Z","timestamp":1127813733000},"page":"442-461","source":"Crossref","is-referenced-by-count":2,"title":["Complexity and Intensionality in a Type-1 Framework for Computable Analysis"],"prefix":"10.1007","author":[{"given":"Branimir","family":"Lambov","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"89","volume":"20","author":"U. Berger","year":"2005","unstructured":"Berger, U., Oliva, P.: Modified Bar Recursion and Classical Dependent Choice. Lecture Notes in Logic\u00a020, 89\u2013107 (2005)","journal-title":"Lecture Notes in Logic"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(95)00249-9","volume":"162","author":"V. Brattka","year":"1996","unstructured":"Brattka, V.: Recursive characterisation of computable real-valued functions and relations. Theoret. Comput. Sci.\u00a0162, 47\u201377 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR3","unstructured":"Briggs, K.: Implementing exact real arithmetic in python, C++ and C (to appear in Journal of theoretical computer science), See also http:\/\/more.btexact.com\/people\/briggsk2\/xrc.html"},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1145\/507382.507387","volume":"3","author":"S.R. Buss","year":"2002","unstructured":"Buss, S.R., Kapron, B.M.: Resource-bounded continuity and sequentiality for type-two functionals. ACM Transactions on Computational Logic\u00a03(3), 402\u2013417 (7\/2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A., Kapron, B.M.: Characterizations of the basic feasible functionals of finite type. In: Buss, S., Scott, P. (eds.) Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, pp. 71\u201396 (1990)","DOI":"10.1007\/978-1-4612-3466-1_5"},{"key":"31_CR6","series-title":"Math. Sci. Res. Inst. Publ","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-1-4612-2822-6_3","volume-title":"Logic from computer science","author":"Cook","year":"1992","unstructured":"Cook, Stephen, A.: Computability and complexity of higher type functions. In: Logic from computer science, Berkeley, CA, 1989. Math. Sci. Res. Inst. Publ, vol.\u00a021, pp. 51\u201372. Springer, New York (1992)"},{"key":"31_CR7","unstructured":"Edalat, A.: Exact Real Number Computation Using Linear Fractional Transformations. Final Report on EPSRC grant GR\/L43077\/01, Available at http:\/\/www.doc.ic.ac.uk\/~ae\/exact-computation\/exactarithmeticfinal.ps.gz"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00097-8","volume":"210","author":"A. Edalat","year":"1999","unstructured":"Edalat, A., S\u00fcnderhauf, P.: A domain-theoretic approach to computability on the real line. Theoret. Comput. Sci.\u00a0210(1), 73\u201398 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1017\/S0960129504004360","volume":"14","author":"M. Escardo","year":"2004","unstructured":"Escardo, M., Hofmann, M., Streicher, T.: On the non-sequential nature of the intervaldomain model of real-number computation. Math. Struct. in Comp. Science\u00a014, 803\u2013814 (2004)","journal-title":"Math. Struct. in Comp. Science"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1111\/j.1746-8361.1958.tb01464.x","volume":"12","author":"K. G\u00f6del","year":"1958","unstructured":"G\u00f6del, K.: \u00dcber eine bisher noch nicht ben\u00fctzte Erweiterung des finiten Standpunktes. Dialectica\u00a012, 280\u2013287 (1958)","journal-title":"Dialectica"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"Grzegorczyk, A.: On the definitions of computable real continuous functions. Fundamenta Matematicae\u00a044, 61\u201367 (1957)","journal-title":"Fundamenta Matematicae"},{"key":"31_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12898-5","volume-title":"Recursion-theoretic hierarchies","author":"P.G. Hinman","year":"1978","unstructured":"Hinman, P.G.: Recursion-theoretic hierarchies. Springer, Heidelberg (1978)"},{"key":"31_CR13","first-page":"454","volume-title":"Metamathematical investigation of intuitionistic arithmetic and analysis","author":"W.A. Howard","year":"1973","unstructured":"Howard, W.A.: Hereditarily majorizable functionals of finite type. In: Troelstra (ed.) Metamathematical investigation of intuitionistic arithmetic and analysis, vol.\u00a0344, pp. 454\u2013461. Springer LNM, Heidelberg (1973)"},{"issue":"1","key":"31_CR14","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 J. Comput.\u00a025(1), 117\u2013132 (1996)","journal-title":"SIAM J. Comput."},{"key":"31_CR15","first-page":"81","volume-title":"Constructivity in Mathematics","author":"S.C. Kleene","year":"1959","unstructured":"Kleene, S.C.: Countable Functionals. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 81\u2013100. North-Holland, Amsterdam (1959)"},{"key":"31_CR16","first-page":"1","volume":"91","author":"S.C. Kleene","year":"1959","unstructured":"Kleene, S.C.: Recursive Functionals and Quantifiers of Finite Types I. Trans. Amer. Math. Soc.\u00a091, 1\u201352 (1959)","journal-title":"Trans. Amer. Math. Soc."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Ko, K.-I.: Complexity theory of real functions. Birkh\u00e4user, Boston-Basel-Berlin (1991)","DOI":"10.1007\/978-1-4684-6802-1"},{"key":"31_CR18","unstructured":"Kohlenbach, U.: Theory of majorizable and continuous functionals and their use for the extraction of bounds from non-constructive proofs: effective moduli of uniqueness for best approximations from ineffective proofs of uniqueness (german). PhD Dissertation, Frankfurt (1990)"},{"key":"31_CR19","first-page":"101","volume-title":"Constructivity in Mathematics","author":"G. Kreisel","year":"1959","unstructured":"Kreisel, G.: Interpretation of analysis by means of functionals of finite type. In: Heyting, A. (ed.) Constructivity in Mathematics, pp. 101\u2013128. North-Holland, Amsterdam (1959)"},{"key":"31_CR20","unstructured":"Lambov, B.: A two-layer approach to the computability and complexity of real functions. Computability and complexity in analysis (Cincinnati, 2003), 279\u2013302, Informatik Berichte, 302, Fernuniversit\u00e4t Hagen (8\/2003), See also http:\/\/www.brics.dk\/~barnie\/RealLib\/"},{"key":"31_CR21","unstructured":"Lambov, B.: RealLib, an Efficient Implementation of Exact Real Arithmetic (submitted), Available at http:\/\/www.brics.dk\/~barnie\/RealPractical.pdf"},{"key":"31_CR22","unstructured":"Lambov, B.: RealLib3 Manual, Available at http:\/\/www.brics.dk\/~barnie\/RealLib\/"},{"key":"31_CR23","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569869","volume-title":"Action Semantics","author":"P.D. Mosses","year":"1992","unstructured":"Mosses, P.D.: Action Semantics. Cambridge Tracts in Theoretical Computer Science, vol.\u00a026. Cambridge University Press, Cambridge (1992)"},{"key":"31_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1989)"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Marcial-Romero, J.R., Escardo, M.: Semantics of a sequential language for exact realnumber computation. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 426\u2013435 (7\/2004)","DOI":"10.1109\/LICS.2004.1319637"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45335-0_14","volume-title":"Computability and Complexity in Analysis","author":"N. M\u00fcller","year":"2001","unstructured":"M\u00fcller, N.: The iRRAM: Exact arithmetic in C++. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, p. 222. Springer, Heidelberg (2001), See also http:\/\/www.informatik.uni-trier.de\/iRRAM\/"},{"key":"31_CR27","unstructured":"Schwichtenberg, H.: Constructive Analysis with Witnesses (Marktoberdorf 2003) (2003), Available at http:\/\/www.mathematik.uni-muenchen.de\/~schwicht\/papers\/mod03\/modart03.ps"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-45335-0_17","volume-title":"Computability and Complexity in Analysis","author":"D. Skordev","year":"2001","unstructured":"Skordev, D.: Characterization of the computable real numbers by means of primitive recursive functions. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol.\u00a02064, pp. 296\u2013309. Springer, Heidelberg (2001)"},{"key":"31_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Heidelberg (2000)"},{"key":"31_CR30","doi-asserted-by":"crossref","unstructured":"Yap, Chee: Towards Exact Geometric Computation. Computational Geometry: Theory and application, 3-23 (9\/1997), See also http:\/\/www.cs.nyu.edu\/exact\/core\/","DOI":"10.1016\/0925-7721(95)00040-2"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:13:41Z","timestamp":1605626021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11538363_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}