Abstract
This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definability theory to introduce computability of functionals from arbitrary domain to the real numbers. We show how this concept works in particular cases.
The authors would like to thank Klaus Weihrauch and Konstantin Korovin for useful discussions.
The first author was supported by the DFG grant N: We 843/17-1 “Berechenbare Analysis”.
The first and the second authors were partially supported by the DFG grant N:436RUS113/638, Grant Scientific School N:2112.2003.1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M.: First-order definability on finite structures. Annals of Pure and Applied Logic 45, 211–225 (1989)
Barwise, J.: Admissible sets and Structures. Springer, Berlin (1975)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Berlin (1996)
Ershov, Y.L.: Definability and computability. Plenum, New-York (1996)
Friedman, H., Ko, K.: Computational complexity of real functions. Theoretical Computer Science 20, 323–352 (1992)
Korovina, M., Kudinov, O.: Characteristic properties of majorant-computability over the reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 188–204. Springer, Heidelberg (1999)
Korovina, M., Kudinov, O.: Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 146–168. Springer, Heidelberg (2001)
Korovina, M., Kudinov, O.: Semantic Characterisations of Second-Order Computability over the Real Numbers. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 160–173. Springer, Heidelberg (2001)
Korovina, M.V.: Gandy’s Theorem on Abstract Structures without the Equality Test. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol. 2850, pp. 290–301. Springer, Heidelberg (2003)
Korovina, M.: Computational aspects of Σ-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 330–344. Springer, Heidelberg (2003)
Korovina, M., Kudinov, O.: Towards Computability of Higher Type Continuous Data. the full version, http://www.brics.dk/~korovina/highertypes.pdf
Moschovakis, Y.N.: Abstract first order computability I, II. Transactions of the American Mathematical Society 138, 427–504 (1969)
Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1988)
Tucker, J.V., Zucker, J.I.: Projections of semicomputable relations on astract data types. International Journal of the Foundations of Computer Science 2, 267–296 (1991)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korovina, M., Kudinov, O. (2005). Towards Computability of Higher Type Continuous Data. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_30
Download citation
DOI: https://doi.org/10.1007/11494645_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)