Absolutely non-computable predicates and functions in analysis

DOI10.1017/S096012950800724XzbMath1159.03043OpenAlexW2167771004MaRDI QIDQ3616216

Yongcheng Wu, Weihrauch, Klaus, Ding, Decheng

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096012950800724x

zbMATH Keywords

computable analysisType-2 Theory of Effectivitymulti-representationsabsolutely non-computable functionscomputable measure spacesrepresentation approach

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Applications of computability and recursion theory (03D80)

Related Items (1)

Analytic computable structure theory and $L^p$ spaces

Cites Work

• Computability of measurable sets via effective topologies
• Computability on computable metric spaces
• A computable version of the Daniell-Stone theorem on integration and linear functionals
• A Real Number Structure that is Effectively Categorical
• Absolutely Non-effective Predicates and Functions in Computable Analysis
• Computability of measurable sets via effective metrics

This page was built for publication: Absolutely non-computable predicates and functions in analysis