Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data

09/23/2018
by   Akitoshi Kawamura, et al.
0

Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational complexity -- already regarding real numbers, not to mention more advanced (e.g. Sobolev) spaces. For a general theory of computational complexity over continuous data we introduce and justify QUANTITATIVE admissibility as requirement for sensible encodings of arbitrary compact metric spaces, a refinement of qualitative 'admissibility' due to [Kreitz&Weihrauch'85]: An admissible representation of a T0 space X is a (i) continuous partial surjective mapping from the Cantor space of infinite binary sequences which is (ii) maximal w.r.t. continuous reduction. By the Kreitz-Weihrauch (aka "Main") Theorem of computability over continuous data, for fixed spaces X,Y equipped with admissible representations, a function f:X→ Y is continuous iff it admits continuous a code-translating mapping on Cantor space, a so-called REALIZER. We define a QUANTITATIVELY admissible representation of a compact metric space X to have (i) asymptotically optimal modulus of continuity, namely close to the entropy of X, and (ii) be maximal w.r.t. reduction having optimal modulus of continuity in a similar sense. Careful constructions show the category of such representations to be Cartesian closed, and non-empty: every compact X admits a linearly-admissible representation. Moreover such representations give rise to a tight quantitative correspondence between the modulus of continuity of a function f:X→ Y on the one hand and on the other hand that of its realizer: the MAIN THEOREM of computational complexity. This suggests (how) to take into account the entropies of the spaces under consideration when measuring algorithmic cost over continuous data.

READ FULL TEXT
research
09/23/2018

Quantitatively Admissible Representations and the "Main Theorem" of Continuous COMPLEXITY Theory

Choosing an encoding over binary strings for input/output to/by a Turing...
research
09/23/2018

Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory

Choosing an encoding over binary strings is usually straightforward or i...
research
11/28/2017

Parametrised second-order complexity theory with applications to the study of interval computation

We extend the framework for complexity of operators in analysis devised ...
research
02/10/2020

A Quantitative Multivalued Selection Theorem for Encoding Spaces of Continuum Cardinality

Previous work (Pauly Ziegler'13) had introduced and justified a qualit...
research
06/28/2019

Computing Haar Measures

According to Haar's Theorem, every compact group G admits a unique left-...
research
04/11/2020

Computing with Continuous Objects: A Uniform Co-inductive Approach

A uniform approach to computing with infinite objects like real numbers,...
research
12/02/2005

A geometry of information, I: Nerves, posets and differential forms

The main theme of this workshop (Dagstuhl seminar 04351) is `Spatial Rep...

Please sign up or login with your details

Forgot password? Click here to reset