Skip to main content Accessibility help
×
Home

Absolutely non-computable predicates and functions in analysis

  • KLAUS WEIHRAUCH (a1), YONGCHENG WU (a2) and DECHENG DING (a3)

Abstract

In the representation approach (TTE) to computable analysis, the representations of an algebraic or topological structure for which the basic predicates and functions become computable are of particular interest. There are, however, many predicates (like equality of real numbers) and functions that are absolutely non-computable, that is, not computable for any representation. Many of these results can be deduced from a simple lemma. In this article we prove this lemma for multi-representations and apply it to a number of examples. As applications, we show that various predicates and functions on computable measure spaces are absolutely non-computable. Since all the arguments are topological, we prove that the predicates are not relatively open and the functions are not relatively continuous for any multi-representation.

Copyright

References

Hide All
Bauer, H. (1974) Wahrscheinlichkeitstheorie und Grundzüge der, Walter de Gruyter, Berlin.
Bauer, H. (2001) Measure and Integration Theory, Walter de Gruyter, Berlin.
Cohn, D. L. (1980) Measure Theory, Birkhäuser.
Ding, D., Weihrauch, K. and Wu, Y. (2007) Absolutely non-effective predicates and functions in computable analysis. In: Cai, J.-Y., Cooper, S. B. and Zhou, H. (eds.) Theory and Applications of Models of Computation. Springer-Verlag Lecture Notes in Computer Science 4484 595604.
Engelking, R. (1989) General Topology, Sigma series in pure mathematics 6, Heldermann, Berlin.
Hertling, P. (1999) A real number structure that is effectively categorical. Mathematical Logic Quarterly 45 (2)147182.
Schröder, M. (2003) Admissible representations for continuous computations. Dissertation. Informatik Berichte 299, FernUniversität Hagen, Hagen, April 2003.
Weihrauch, K. (1993) Computability on computable metric spaces. Theoretical Computer Science 113 191210.
Weihrauch, K. (2000) Computable Analysis, Springer, Berlin.
Weihrauch, K. (2008) The computable multi-functions on multi-represented sets are closed under programming. To appear in Journal of Universal Computer Science.
Wu, Y. and Ding, D. (2005) Computabibility of measurable sets via effective metrics. Mathematical Logic Quarterly 51 (6)543559.
Wu, Y. (2005) Computable Measure Theory, Ph.D. Dissertation, Nanjing University.
Wu, Y. and Ding, D. (2006) Computabibility of measurable sets via effective topologies. Archive for Mathematical Logic 45 365379.
Wu, Y. and Weihrauch, K. (2006) A computable version of the Daniell–Stone theorem on integration and linear functionals. Theoretical Computer Science 359 (1-3)2842.

Related content

Powered by UNSILO

Absolutely non-computable predicates and functions in analysis

  • KLAUS WEIHRAUCH (a1), YONGCHENG WU (a2) and DECHENG DING (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.