A topological characterization of random sequences

Information Processing Letters

Volumn 88, Issue 5, 2003, Pages 245-250

  Calude, Cristian S ^a   Marcus, Solomon ^b   Staiger, Ludwig ^c  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Martin L f test; Random sequence; Theory of computation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; SET THEORY; THEOREM PROVING; TOPOLOGY;

RANDOM SEQUENCES;

DATA PROCESSING;

EID: 0242366077     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.07.002     Document Type: Article

References (19)

1. Calude C. Borel normality and algorithmic randomness. Rozenberg G., Salomaa A. Developments in Language Theory. 1994;113-129 World Scientific, Singapore.
2. Calude C.S. Information and Randomness. An Algorithmic Perspective. 2nd edn. 2002;Springer Verlag, Berlin.
3. Calude C., Chiţescu I. Random sequences: some topological and measure-theoretical properties. An. Univ. Bucureşti Mat.-Inf. 2:1988;27-32.
4. Chaitin G.J. Algorithmic Information Theory. 1987;Cambridge University Press, Cambridge. (3rd printing 1990).
5. Chaitin G.J. Exploring Randomness. 2001;Springer-Verlag, London.
6. Gács P. Every sequence is reducible to a random one. Inform. and Control. 70:1986;186-192.
7. Hertling P. Surjective functions on computably growing Cantor sets. J. UCS. 3:1997;1226-1240.
8. Mǎndoiu I. On a theorem of Gács. Int. J. Comput. Math. 48:1993;157-169.
9. Martin-Löf P. The definition of random sequences. Inform. and Control. 9:1966;602-619.
10. Martin-Löf P. Notes on Constructive Mathematics. 1970;Almqvist & Wiksell, Stockholm.
11. Oxtoby J.C. Measure and Category. 1971;Springer-Verlag, Berlin.
12. Oxtoby J.C., Ulam S.M. Measure preserving homeomorphisms and metrical transitivity. Ann. Math. 42:1941;874-925.
13. Schnorr C.P. Zufälligkeit und Wahrscheinlichkeit. Lecture Notes in Math. 218:1971;Springer-Verlag, Berlin.
14. Staiger L. Sequential mappings of ω -languages. RAIRO Inform. Théor. 21:1987;147-173.
15. Staiger L. ω -languages. Rozenberg G., Salomaa A. Handbook of Formal Languages. 3:1997;339-387 Springer-Verlag, Berlin.
16. Staiger L. Topologies for the set of disjunctive ω -words. Ito M., Pǎun Gh., Yu Sh. Words, Semigroups & Transductions, Festschrift in Honor of Gabriel Thierrin. 2001;421-430 World Scientific, Singapore.
17. L. Staiger, Weighted finite automata and metrics in Cantor Space, J. Automata, Languages and Combinatorics, submitted for publication.
18. Thomas W. Automata on infinite objects. Van Leeuwen J. Handbook of Theoretical Computer Science. Vol. B:1990;133-191 Elsevier, Amsterdam.
19. Zindulka O. Killing residual measures. J. Appl. Anal. 5:1999;223-238.