Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. K. Ambos-Spies and E. Mayordomo. Resource-bounded measure and randomness. In Complexity, Logic, and Recursion Theory, Marcel Dekker, Inc, 1997.
2. K. Ambos-Spies and A. Kučera. Randomness in Computability Theory. In P. Cholak et al. (eds.), Computability Theory: Current Trends and Open Problems, Contemporary Mathematics 257:1–14, American Mathematical Society, 2000.
3. J.L. Balcázar, J. Díaz and J. Gabarró. Structural Complexity, Vol. I and II. Springer, 1995 and 1990.
4. A. Church. On the concept of a random number. Bulletin of the AMS, 46:130–135, 1940.
5. R. P. Daley. Minimal-program complexity of pseudo-recursive and pseudo-random sequences. Mathematical Systems Theory, 9:83–94, 1975.