Closed sets and operators thereon: representations, computability and complexity

DOI10.23638/LMCS-14(2:1)2018zbMATH Open1426.03027arXiv1701.00227MaRDI QIDQ4637697FDOQ4637697

Carsten Rösnick-Neugebauer

Publication date: 25 April 2018

Abstract: The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such representations had been devised over the past decades, particularly regarding closed subsets of Euclidean space plus subclasses thereof (like compact subsets). In addition, they had been compared and classified with respect to both non-uniform computability of single sets and uniform computability of operators on sets. In this paper we refine these investigations from the point of view of computational complexity. Benefiting from the concept of second-order representations and complexity recently devised by Kawamura & Cook (2012), we determine parameterized complexity bounds for operators such as union, intersection, projection, and more generally function image and inversion. By indicating natural parameters in addition to the output precision, we get a uniform view on results by Ko (1991-2013), Braverman (2004/05) and Zhao & M"uller (2008), relating these problems to the P/UP/NP question in discrete complexity theory.

Full work available at URL: https://arxiv.org/abs/1701.00227

Recommendations

• scientific article; zbMATH DE number 2013199
• scientific article; zbMATH DE number 1460545
• scientific article; zbMATH DE number 1101599
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• scientific article

zbMATH Keywords

computable analysistype-2 theory of effectivitysecond-order representation

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Representations of the real numbers and of the open subsets of the set of real numbers
• Computations with finite closure systems and implications
• Elementary computable topology
• Computable operators on regular sets
• The computable multi-functions on multi-represented sets are closed under programming
• Title not available (Why is that?)
• Singular coverings and non‐uniform notions of closed set computability
• Effectively closed sets and graphs of computable real functions.

Uses Software

• iRRAM

This page was built for publication: Closed sets and operators thereon: representations, computability and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637697)