Author:
WEIHRAUCH KLAUS,WU YONGCHENG,DING DECHENG
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 areabsolutely 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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference14 articles.
1. Computability of measurable sets via effective metrics
2. Schröder M. (2003) Admissible representations for continuous computations. Dissertation. Informatik Berichte 299, FernUniversität Hagen, Hagen, April 2003.
3. Computability of measurable sets via effective topologies
4. Weihrauch K. (2008) The computable multi-functions on multi-represented sets are closed under programming. To appear in Journal of Universal Computer Science.
5. Computable Analysis
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献