Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A topological characterization of random sequences
Calude C., Marcus S., Staiger L. Information Processing Letters88 (5):245-250,2003.Type:Article
Date Reviewed: Mar 4 2004

Random sequences within the framework of algorithmic information theory are discussed in this paper. (An excellent introduction to the area was written by Calude [1].) Specifically, the paper studies the set of random sequences from a topological point of view. Such a study is interesting in itself, and has connections with probability theory. The authors prove that there is a natural topology, which is indeed a relativization of the Cantor topology, with respect to which the set of random numbers is topologically large. The paper is of definite interest to researchers working on the fundamentals of the theory of computation.

Reviewer:  Arto Salomaa Review #: CR129192 (0408-0957)
1) Calude, C. Information and randomness. Springer-Verlag, New York, NY, 2002.
Bookmark and Share
 
Computability Theory (F.1.1 ... )
 
 
Unbounded-Action Devices (F.1.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Computability Theory": Date
Decidability of the purely existential fragment of the theory of term algebras
Venkataraman K. Journal of the ACM 34(2): 492-510, 1987. Type: Article
Jul 1 1988
Computability
Weihrauch K. (ed), Springer-Verlag New York, Inc., New York, NY, 1987. Type: Book (9789780387137216)
Nov 1 1988
Computability and logic: 3rd ed.
Boolos G., Jeffrey R., Cambridge University Press, New York, NY, 1989. Type: Book (9789780521380263)
Jul 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy