Relative computability and uniform continuity of relations

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based, computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f :[0,1]→ℝ is computable relative to some oracle. In their search for a similar topological characterization of relatively computable multi- valued functions f :[0,1]⇒ℝ (aka relations), Brattka and Hertling (1994) have considered two notions: weak continuity (which is weaker than relative computability) and strong continuity (which is stronger than relative computability). Observing that uniform continuity plays a crucial role in the Weierstrass Theorem, we propose and compare several notions of uniform continuity for relations. Here, due to the additional quantification over values y ∈ f ( x ), new ways arise of (linearly) ordering quantifiers — yet none turns out as satisfactory. We are thus led to a concept of uniform continuity based on the Henkin quantifier ; and prove it necessary for relative computability of compact real relations. In fact iterating this condition yields a strict hierarchy of notions each necessary — and the ω-th level also sufficient — for relative computability.

[1]  Ulrich Kohlenbach,et al.  Fluctuations, effective learnability and metastability in analysis , 2014, Ann. Pure Appl. Log..

[2]  Norbert Th. Müller,et al.  The iRRAM: Exact Arithmetic in C++ , 2000, CCA.

[3]  Martin Ziegler,et al.  Computability in linear algebra , 2004, Theor. Comput. Sci..

[4]  Klaus Weihrauch Electronic Colloquium on Computational Complexity, Report No. 14 (2002) Computational Complexity on Computable Metric Spaces , 2022 .

[5]  Martin Ziegler,et al.  Revising Type-2 Computation and Degrees of Discontinuity , 2006, CCA.

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

[7]  Dieter Spreen,et al.  Effectivity and effective continuity of multifunctions , 2010, The Journal of Symbolic Logic.

[8]  Arnold Neumaier,et al.  Continuity notions for multi-valued mappings , 2006 .

[9]  Jon Barwise,et al.  Some applications of Henkin quantifiers , 1976 .

[10]  A. C. Thompson,et al.  Theory of correspondences : including applications to mathematical economics , 1984 .

[11]  K. Weirauch Computational complexity on computable metric spaces , 2003 .

[12]  Joseph S. Miller,et al.  Degrees of unsolvability of continuous functions , 2004, Journal of Symbolic Logic.

[13]  Vassilios Gregoriades The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function , 2011 .

[14]  Arno Pauly,et al.  Closed choice and a Uniform Low Basis Theorem , 2010, Ann. Pure Appl. Log..

[15]  Ulrich Kohlenbach,et al.  On uniform weak König's lemma , 2002, Ann. Pure Appl. Log..

[16]  Matthias Schröder,et al.  Extended admissibility , 2002, Theor. Comput. Sci..

[17]  Akitoshi Kawamura,et al.  Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime , 2012, ArXiv.

[18]  Sidney A. Morris,et al.  TOPOLOGY WITHOUT TEARS 1 , 2007 .

[19]  Vasco Brattka,et al.  Weihrauch degrees, omniscience principles and weak computability , 2009, J. Symb. Log..

[20]  Matthias Schröder,et al.  Spaces allowing Type‐2 Complexity Theory revisited , 2004, Math. Log. Q..

[21]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[22]  Vasco Brattka,et al.  Computability over Topological Structures , 2003 .

[23]  V. Brattka,et al.  Continuity and Computability of Relations , 1994 .

[24]  Horst Luckhardt A Fundamental Effect in Computations on Real Numbers , 1977, Theor. Comput. Sci..

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

[26]  Jouko A. Väänänen,et al.  Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.

[27]  M. Beeson Foundations of Constructive Mathematics , 1985 .

[28]  Klaus Weihrauch,et al.  The Computable Multi-Functions on Multi-represented Sets are Closed under Programming , 2008, J. Univers. Comput. Sci..

[29]  Akihiro Yamamoto,et al.  Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data , 2006, ALT.

[30]  J. E. Jayne THEORY OF CORRESPONDENCES Including Applications to Mathematical Economics (Canadian Mathematical Society Series of Monographs and Advanced Texts) , 1985 .

[31]  Christoph Kreitz,et al.  Compactness in constructive analysis revisited , 1987, Ann. Pure Appl. Log..

[32]  H. Jerome Keisler,et al.  Barwise: Infinitary Logic and Admissible Sets , 2004, Bulletin of Symbolic Logic.

[33]  Arno Pauly,et al.  How Incomputable is Finding Nash Equilibria? , 2010, J. Univers. Comput. Sci..

[34]  Vasco Brattka,et al.  Recursive Characterization of Computable Real-Valued Functions and Relations , 1996, Theor. Comput. Sci..

[35]  Martin Ziegler Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra , 2012, Ann. Pure Appl. Log..

[36]  Martin Ziegler,et al.  Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra , 2008, Ann. Pure Appl. Log..

[37]  Arnold Neumaier,et al.  Continuity Notions for Multi-Valued Mappings with Possibly Disconnected Images , 2012, Reliab. Comput..

[38]  Ernst Specker,et al.  The Fundamental Theorem of Algebra in Recursive Analysis , 1990 .