Randomness spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 796-807

  Hertling, Peter ^a   Weihrauch, Klaus ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SET THEORY; TOPOLOGY;

ANALYTIC FUNCTIONS; FINITE ALPHABET; NATURAL NUMBER; RANDOM REALS; RANDOM SEQUENCE; RANDOMNESS PRESERVATION; RANDOMNESS TEST; TOPOLOGICAL SPACES;

RANDOM PROCESSES;

EID: 84878538144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055103     Document Type: Conference Paper

References (20)

1. C. S. Calude, P. Hertling, B. Khoussainov, and Y. Wang. Recursively enumerable reals and Chaitin Ω numbers. In M. Morvan et al., editor, STACS 98, Proceedings, LNCS 1373, pages 596-606, Springer-Verlag, Berlin, 1998.
2. C. S. Calude and H. Jiirgensen. Randomness as an invariant for number representations. In H. Maurer, J. Karhumäki, and G. Rozenberg, editors, Results and Trends in Theoretical Computer Science, pages 44-66. Springer-Verlag, Berlin, 1994.
3. G. J. Chaitin. On the length of programs for computing finite binary sequences. J. of the ACM, 13:547-569, 1966.
4. G. J. Chaitin. A theory of program size formally identical to information theory. J. of the ACM, 22:329-340, 1975.
5. A. Grzegorczyk. On the definitions of computable real continuous functions. Fund. Math., 44:61-71, 1957.
6. P. Hertling and Y. Wang. Invariance properties of random sequences. J. UCS, 3(11):1241-1249, 1997.
7. K.-I. Ko. Complexity Theory of Real Functions. Birkhäuser, Boston, 1991.
8. A. N. Kolmogorov. Three approaches to the quantitative definition of information. Problems of Information Transmission, 1:1-7, 1965.
9. C. Kreitz and K. Weihrauch. Theory of representations. Theor. Comp. Science, 38:35-53, 1985.
10. L. A. Levin. Randomness conservation inequalities: information and randomness in mathematical theories. Information and Control, 61:15-37, 1984.
11. P. Martin-Löf. The definition of random sequences. Information and Control, 9(6):602-619, 1966.
12. M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Springer-Verlag, Berlin, Heidelberg, 1989.
13. C.-P. Schnorr. Zufälligkeit und Wahrscheinlichkeit, Volume 218 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1971.
14. R. I. Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin, 1987.
15. R. J. Solomonoff. A formal theory of inductive inference I, II. Information and Control, 7:1-22, 224-254, 1964.
16. J. Ville. Etude Critique de la Notion de Collectif. Gauthier-Villars, Paris, 1939.
17. R. von Mises. Grundlagen der Wahrscheinlichkeitsrechnung. Mathem. Zeitschrift, 5:52-99, 1919.
18. K. Weihrauch. Computability. Springer-Verlag, Berlin, 1987.
19. K. Weihrauch. A foundation for computable analysis. In D. S. Bridges et al., editor, Combinatorics, Complexity, and Logic, Proceedings of DMTCS'96, pages 66-89, Springer-Verlag, Singapore, 1997.
20. A. K. Zvonkin and L. A. Levin. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Math. Surveys, 25(6):83-124, 1970.