Computability of finite-dimensional linear subspaces and best approximation

DOI10.1016/j.apal.2010.09.011zbMath1223.03051OpenAlexW1993745156MaRDI QIDQ638485

Ruth Dillhage, Vasco Brattka

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.09.011

zbMATH Keywords

best approximationmetric projectioncomputable Banach spacescomputable functional analysis

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Constructive functional analysis (46S30) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computability in linear algebra
• Techniques of constructive analysis
• Borel complexity and computability of the Hahn-Banach theorem
• On the foundations of best approximation theory
• A constructive proximinality property of finite-dimensional linear subspaces
• Computability on subsets of metric spaces.
• Extended admissibility.
• Weihrauch degrees, omniscience principles and weak computability
• Unique solutions
• Corrigendum to “Unique solutions”
• Plottable Real Number Functions and the Computable Graph Theorem
• An Introduction to Banach Space Theory
• Computational complexity on computable metric spaces
• Computability in Analysis and Physics
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics

This page was built for publication: Computability of finite-dimensional linear subspaces and best approximation