Complexity for partial computable functions over computable Polish spaces

In the framework of effectively enumerable topological spaces, we introduce the notion of a partial computable function. We show that the class of partial computable functions is closed under composition, and the real-valued partial computable functions defined on a computable Polish space have a principal computable numbering. With respect to the principal computable numbering of the real-valued partial computable functions, we investigate complexity of important problems such as totality and root verification. It turns out that for some problems the corresponding complexity does not depend on the choice of a computable Polish space, whereas for other ones the corresponding choice plays a crucial role.

[1]  James Stuart Tanton,et al.  Encyclopedia of Mathematics , 2005 .

[2]  Victor L. Selivanov.  Index-Sets of Factor-Objects of the Post Numbering , 1987, FCT.

[3]  Egon Börger,et al.  Logic and Machines: Decision Problems and Complexity , 1984, Lecture Notes in Computer Science.

[4]  Robert I. Soare,et al.  Recursively enumerable sets and degrees - a study of computable functions and computability generated sets , 1987, Perspectives in mathematical logic.

[5]  A. Kechris.  Classical descriptive set theory , 1987 .

[6]  Valentina Harizanov.  Computable Structures and the Hyperarithmetical Hierarchy . Studies in Logic and the Foundations of Mathematics , 2001 .

[7]  Oleg V. Kudinov,et al.  Index Sets as a Measure of Continuous Constraint Complexity , 2014, Ershov Memorial Conference.

[8]  Oleg V. Kudinov,et al.  The Uniformity Principle for Sigma-definability , 2009, J. Log. Comput..

[9]  S. Fomin,et al.  Elements of the Theory of Functions and Functional Analysis , 1961 .

[10]  Y. Ershov.  Model of Partial Continuous Functionals , 1977 .

[11]  Rodney G. Downey,et al.  THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE. , 2008 .

[12]  Tomás Recio,et al.  Ordered fields and real algebraic geometry , 1982 .

[13]  Julia F. Knight,et al.  Index sets for classes of high rank structures , 2007, J. Symb. Log..

[14]  Victor L. Selivanov.  Towards the Effective Descriptive Set Theory , 2015, CiE.

[15]  Douglas A. Cenzer,et al.  Effectively closed sets and enumerations , 2008, Arch. Math. Log..

[16]  Oleg V. Kudinov,et al.  Towards Computability of Higher Type Continuous Data , 2005, CiE.

[17]  Julia F. Knight,et al.  Index sets of computable structures , 2006 .

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

[19]  Oleg V. Kudinov,et al.  Positive predicate structures for continuous data , 2015, Math. Struct. Comput. Sci..

[20]  Y. Moschovakis.  Recursive metric spaces , 1964 .

[21]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

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

[23]  V. L. Selivanov,et al.  Index sets of quotient objects of the post numeration , 1988 .

[24]  Douglas A. Cenzer,et al.  Index Sets for Pi01 Classes , 1998, Ann. Pure Appl. Log..

[25]  Yuri L. Ershov,et al.  Theory of Numberings , 1999, Handbook of Computability Theory.

[26]  Klaus Weihrauch,et al.  Computability on Computable Metric Spaces , 1993, Theor. Comput. Sci..

[27]  Joel David Hamkins,et al.  Borel structures: a brief survey , 2013 .

[28]  Vasco Brattka,et al.  Borel Complexity of Topological Operations on Computable Metric Spaces , 2009, J. Log. Comput..

[29]  A. Frolov,et al.  Spectra of High n and Nonlow n Degrees , 2010 .

[30]  Julia A. Knight,et al.  Computable structures and the hyperarithmetical hierarchy , 2000 .

[31]  Klaus Ambos-Spies,et al.  Degrees of Unsolvability , 2014, Computational Logic.

[32]  Rodney G. Downey,et al.  Uniformity in Computable Structure Theory , 2001 .

[33]  Douglas Cenzer,et al.  Index Sets in Computable Analysis , 1999, Theor. Comput. Sci..

[34]  Dieter Spreen,et al.  On effective topological spaces , 1998, Journal of Symbolic Logic.

[35]  Matthias Schroder,et al.  Hyperprojective Hierarchy of QCB_0-spaces , 2014, 1404.0297.

[36]  Oleg V. Kudinov,et al.  Towards Computability over Effectively Enumerable Topological Spaces , 2008, CCA.

[37]  J. Ersov.  Theorie der Numerierungen II , 1973 .

[38]  Victor L. Selivanov,et al.  Hyperprojective Hierarchy of qcb0-Spaces , 2014, CiE.

[39]  Edward R. Griffor.  Handbook of Computability Theory , 1999, Handbook of Computability Theory.

[40]  R. Schindler.  Descriptive Set Theory , 2014 .

[41]  Dieter Spreen.  On Some Decision Problems in Programming , 1995, Inf. Comput..

[42]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[43]  Klaus Weihrauch,et al.  Computable metrization , 2007, Math. Log. Q..

[44]  Dieter Spreen,et al.  On r.e. inseparability of CPO index sets , 1983, Logic and Machines.