Effectively closed sets and graphs of computable real functions

In this paper, we compare the computability and complexity of a continuous real function F with the computability and complexity of the graph G of the function F. A similar analysis will be carried out for functions on subspaces of the real line such as the Cantor space, the Baire space and the unit interval. In particular, we define four basic types of effectively closed sets C depending on whether (i) the set of closed intervals which with nonempty intersection with C is recursively enumerable (r.e.), (ii) the set of closed intervals with empty intersection with C is r.e., (iii) the set of open intervals which with nonempty intersection with C is r.e., and (iv) the set of open intervals with empty intersection with C is r.e. We study the relationships between these four types of effectively closed sets in general and the relationships between these four types of effectively closed sets for closed sets which are graphs of continuous functions.

[1]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[2]  Jeffrey B. Remmel,et al.  Chapter 13 Π10 classes in mathematics , 1998 .

[3]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[4]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[5]  Marian B. Pour-El,et al.  An Introduction to Computable Analysis , 1989 .

[6]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[7]  Klaus Weihrauch,et al.  Computability on Subsets of Euclidean Space I: Closed and Compact Subsets , 1999, Theor. Comput. Sci..

[8]  S. Lempp.  Hyperarithmetical index sets in recursion theory , 1987 .

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

[10]  N. Klarlund.  Progress Measures and Finite Arguments for Infinite Computations , 1990 .

[11]  H. Friedman,et al.  The computational complexity of maximization and integration , 1984 .

[12]  P. Odifreddi.  Classical recursion theory , 1989 .

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

[14]  R. Soare,et al.  Π⁰₁ classes and degrees of theories , 1972 .

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

[16]  Cristian S. Calude,et al.  Combinatorics, Complexity and Logic , 1999 .

[17]  Klaus Weihrauch,et al.  A Foundation of Computable Analysis , 1995, Bull. EATCS.

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

[19]  Kenneth W. Regan,et al.  Computability , 2022, Algorithms and Theory of Computation Handbook.

[20]  Robert I. Soare,et al.  Degrees of members of Π10 classes , 1972 .

[21]  Rina S. Cohen,et al.  omega-Computations on Turing Machines , 1978, Theor. Comput. Sci..

[22]  Ludwig Staiger,et al.  Hierarchies of Recursive omega-languages , 1986, J. Inf. Process. Cybern..

[23]  S. Kleene.  Hierarchies of number-theoretic predicates , 1955 .

[24]  Andrzej Grzegorczyk.  On the definition of computable functionals , 1955 .

[25]  R. O. Gandy,et al.  COMPUTABILITY IN ANALYSIS AND PHYSICS (Perspectives in Mathematical Logic) , 1991 .

[26]  Ludwig Staiger,et al.  Recursive Automata on Infinite Words , 1993, STACS.

[27]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[28]  Ker-I Ko.  On the Computability of Fractal Dimensions and Hausdorff Measure , 1998, Ann. Pure Appl. Log..

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

[30]  J. Remmel,et al.  Recursively presented games and strategies , 1992 .

[31]  Richard Statman,et al.  Logical Methods: In Honor of Anil Nerode's Sixtieth Birthday , 1994 .

[32]  Anil Nerode,et al.  The Introduction of Non-Recursive Methods into Mathematics* , 1982 .

[33]  Douglas Cenzer.  ∏10 Classes in Computability Theory , 1999, Handbook of Computability Theory.