Comparing representations for function spaces in computable analysis
From MaRDI portal
(Redirected from Publication:1635809)
Abstract: This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared to more natural representations for these spaces. The formal framework for the comparisons is provided by Weihrauch reducibility. The centrepiece of the paper considers several representations of the analytic functions on the unit disk and their mutual translations. All translations that are not already computable are shown to be Weihrauch equivalent to closed choice on the natural numbers. Subsequently some similar considerations are carried out for representations of polynomials. In this case in addition to closed choice the Weihrauch degree LPO* shows up as the difficulty of finding the degree or the zeros. As a final example, the smooth functions are contrasted with functions with bounded support and Schwartz functions. Here closed choice on the natural numbers and the lim degree appear.
Recommendations
Cites work
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 1303206 (Why is no real title available?)
- scientific article; zbMATH DE number 1347865 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.
- A topological view on algebraic computation models
- Closed choice and a uniform low basis theorem
- Computability and Noncomputability in Classical Analysis
- Computability theory of generalized functions
- Computable invariance
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Descriptive set theory in the category of represented spaces
- Effective Borel measurability and reducibility of functions
- Effective Choice and Boundedness Principles in Computable Analysis
- Extended admissibility.
- Finite choice, convex choice and finding roots
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Non-deterministic computation and the Jayne-Rogers theorem
- On the (semi)lattices induced by continuous reducibilities
- On the topological aspects of the theory of represented spaces
- Probabilistic computability and choice
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Representations of analytic functions and Weihrauch degrees
- Reverse mathematics of matroids
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Weihrauch degrees, omniscience principles and weak computability
- Weihrauch-completeness for layerwise computability
Cited in
(10)- Computable analysis and notions of continuity in \textsc{Coq}
- Comparison of Some Reduced Representation Approximations
- Complexity theory for spaces of integrable functions
- Representations and evaluation strategies for feasibly approximable functions
- Representations of analytic functions and Weihrauch degrees
- Total representations
- scientific article; zbMATH DE number 7407788 (Why is no real title available?)
- scientific article; zbMATH DE number 408814 (Why is no real title available?)
- Weihrauch Complexity in Computable Analysis
- On Computational Constructions in Function Spaces
This page was built for publication: Comparing representations for function spaces in computable analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1635809)
