Abstract
Generalizing the notion of a recursively enumerable (r.e.) set to sets of real numbers and other metric spaces is an important topic in computable analysis (which is the Turing machine based theory of computable real number functions). A closed subset of a computable metric space is called r. e. closed, if all open rational balls which intersect the set can be effectively enumerated and it is called effectively separable, if it contains a dense computable sequence. Both notions are closely related and in case of Euclidean space (and complete computable metric spaces in general) they actually coincide. Especially, both notions are generalizations of the classical notion of an r.e. subset of natural numbers. However, in case of incomplete metric spaces these notions are distinct. We use the immune set of random natural numbers to construct a recursive immune “tree” which shows that there exists an r.e. closed subset of some incomplete subspace of Cantor space which is not effectively separable. Finally, we transfer this example to the incomplete space of rational numbers (considered as a subspace of Euclidean space).
Work supported by DFG Grant BR 1807/4-1
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Vasco Brattka. Computability of Banach space principles. Informatik Berichte 286, FernUniversität Hagen, Fachbereich Informatik, Hagen, June 2001.
Vasco Brattka. Computability over topological structures. In S. Barry Cooper and Sergey Goncharov, editors, Computability and Models. Kluwer Academic Publishers, Dordrecht, (in preparation).
Vasco Brattka and Gero Presser. Computability on subsets of metric spaces. Theoretical Computer Science, accepted for publication.
Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65–93, 1999.
Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
Piergiorgio Odifreddi. Classical Recursion Theory, volume 125 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1989.
Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
Klaus Weihrauch. Computability on computable metric spaces. Theoretical Computer Science, 113:191–210, 1993. Fundamental Study.
Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000.
Mariko Yasugi, Takakazu Mori, and Yoshiki Tsujii. Effective properties of sets and functions in metric spaces with computability structure. Theoretical Computer Science, 219:467–486, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brattka, V. (2002). Random Numbers and an Incomplete Immune Recursive Set. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_81
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive