Complexity and intensionality in a type-1 framework for computable analysis

Lecture Notes in Computer Science

Volumn 3634, Issue , 2005, Pages 442-461

  Lambov, Branimir ^a,b  

^a AARHUS UNIVERSITY   (Denmark)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; NUMBER THEORY;

INTENSIONAL FUNCTIONS; MACHINE PRECISION FLOATING; REAL FUNCTIONS; REAL NUMBERS;

COMPUTATIONAL COMPLEXITY;

EID: 26944446126     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538363_31     Document Type: Conference Paper

References (30)

1. Berger, U., Oliva, P., Modified Bar Recursion and Classical Dependent Choice. Lecture Notes in Logic 20, 89-107 (2005).
2. Brattka, V., Recursive characterisation of computable real-valued functions and relations. Theoret. Comput. Sci. 162, 47-77 (1996).
3. 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
4. Buss, S.R., Kapron, B.M., Resource-bounded continuity and sequentiality for type-two functionals. ACM Transactions on Computational Logic, vol. 3, no. 3, 402-417 (7/2002).
5. Cook, S.A., Kapron, B.M., Characterizations of the basic feasible functional of finite type. Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, Eds. S. Buss, P. Scott, pp. 71-96 (1990).
6. Cook, Stephen A. Computability and complexity of higher type functions. Logic from computer science (Berkeley, CA, 1989), 51-72, Math. Sci. Res. Inst. Publ., 21, Springer, New York (1992).
7. 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
8. Edalat, Abbas; Sudie;nderhauf, Philipp A domain-theoretic approach to computability on the real line. Theoret. Comput. Sci. 210, no. 1, 73-98 (1999).
9. Escardo, M., Hofmann, M., Streicher, T., On the non-sequential nature of the interval-domain model of real-number computation. Math. Struct, in Comp. Science vol. 14 (2004), 803-814.
10. Gödel, K., Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12, 280-287 (1958).
11. Grzegorczyk, A., On the definitions of computable real continuous functions. Fundamenta Matematicae 44, 61-67 (1957).
12. Hinman, P.G., Recursion-theoretic hierarchies., Springer (1978).
13. Howard, W.A., Hereditarily majorizable functional of finite type. In: Troelstra (ed.), Meta-mathematical investigation of intuitionistic arithmetic and analysis, pp. 454-461. Springer LNM 344 (1973).
14. Kapron, B. M.; Cook, S. A. A new characterization of type-2 feasibility. SIAM J. Comput. 25, no. 1, 117-132 (1996).
15. Kleene, S.C., Countable Functionals. In: A. Heyting (ed), Constructivity in Mathematics, North-Holland, Amsterdam, 81-100 (1959).
16. Kleene, S.C., Recursive Functionals and Quantifiers of Finite Types 1. Trans. Amen Math. Soc. 91, 1-52 (1959).
17. Ko, K.-I., Complexity theory of real functions. Birkhäuser, Boston-Basel-Berlin (1991).
18. Kohlenbach, U., Theory of majorizable and continuous functional 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).
19. Kreisel, G., Interpretation of analysis by means of functional of finite type. In: A. Heyting (ed), Constructivity in Mathematics, North-Holland, Amsterdam, 101-128 (1959).
20. Lambov, B., A two-layer approach to the computability and complexity of real functions. Computability and complexity in analysis (Cincinnati, 2003), 279-302, Informatik Berichte, 302, Fernuniversität Hagen (8/2003). See also http://www.brics.dk/~barnie/RealLib/
21. Lambov, B., RealLib, an Efficient Implementation of Exact Real Arithmetic, submitted. Available at http://www.brics.dk/~barnie/RealPractical. pdf
22. Lambov, B., RealLib3 Manual. Available at http://www.brics.dk/~barnie/ RealLib/
23. Mosses, P. D., Action Semantics. Cambridge Tracts in Theoretical Computer Science 26, Cambridge University Press (1992).
24. Pour-El, M.B., Richards, J.I., Computability in Analysis and Physics. Springer (1989).
25. Marcial-Romero, J.R. and Escardo, M. Semantics of a sequential language for exact real-number computation. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 426-435, (7/2004).
26. Müller, N., The iRRAM: Exact arithmetic in C++. Computability and complexity in analysis. (Swansea, 2000). Lecture Notes in Computer Science 2064. Springer (2001). See also http://www.informatik.uni-trier.de/iRRAM/
27. Schwichtenberg, H., Constructive Analysis with Witnesses (Marktoberdorf '03) Available at http://www.mathematik.uni-muenchen.de/~schwicht/papers/mod03/ modart03.ps
28. Skordev, D., Characterization of the computable real numbers by means of primitive recursive functions. Computability and complexity in analysis (Swansea, 2000), 296-309, Lecture Notes in Computer Science 2064, Springer (2001).
29. Weihrauch, K., Computable Analysis. Springer (2000).
30. Yap, Chee, Towards Exact Geometric Computation. Computational Geometry: Theory and application, 3-23 (9/1997). See also http://www.cs.nyu.edu/exact/ core/