Surjective functions on computably growing cantor sets 1

Journal of Universal Computer Science

Volumn 3, Issue 11, 1997, Pages 1226-1240

  Hertling, Peter ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Computable maps on infinite sequences*Co r.e. Closed sets*Cantor sets*Computability and measure

Indexed keywords

EID: 0242325662     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (4)

1. [Calude 1994] C. S. Calude. Information and Randomness, an Algorithmic Perspective. Springer-Verlag, Berlin, 1994.
2. [Gács 1986] P. Gács. Every sequence is reducible to a random one. Information and Control, 70:186-192, 1986.
3. 0-classes and complete extensions of PA. In H.-D. Ebbinghaus et al., editor, Recursion Theory Week, Proceedings, Oberwolfach 1984, volume 1141 of Lecture Notes in Math., pages 245-259, Berlin, 1985. Springer-Verlag.
4. [Mǎndoiu 1993] I. Mǎndoiu. On a theorem of Gǎcs. Internat. J. Computer Math., 48:157-169, 1993.