Towards Computability of Higher Type Continuous Data

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.

[1]  Yiannis N. Moschovakis,et al.  Abstract first order computability. II , 1969 .

[2]  Jon Barwise,et al.  Admissible sets and structures , 1975 .

[3]  Margarita V. Korovina,et al.  Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test , 2003, CSL.

[4]  J. Shepherdson.  Computational Complexity of Real Functions , 1985 .

[5]  Klaus Weihrauch,et al.  Computable Analysis , 2005, CiE.

[6]  I︠U︡riĭ Leonidovich Ershov.  Definability and Computability , 1996 .

[7]  Miklós Ajtai,et al.  First-Order Definability on Finite Structures , 1989, Ann. Pure Appl. Log..

[8]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[9]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[10]  Peter Hertling,et al.  Computability & Complexity in Analysis , 2001 .

[11]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[12]  Oleg V. Kudinov,et al.  Characteristic Properties of Majorant-Computability over the Reals , 1998, CSL.

[13]  J. V. Tucker,et al.  Projections of Semicomputable Relations on Abstract Data Tzpes , 1991, Int. J. Found. Comput. Sci..

[14]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[15]  Ker-I Ko,et al.  Computational Complexity of Real Functions , 1982, Theor. Comput. Sci..

[16]  Margarita V. Korovina,et al.  Gandy's Theorem for Abstract Structures without the Equality Test , 2003, LPAR.

[17]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[18]  Oleg V. Kudinov,et al.  Semantic Characterisations of Second-Order Computability over the Real Numbers , 2001, CSL.

[19]  Oleg V. Kudinov,et al.  Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory , 2000, CCA.