Resource-bounded balanced genericity, stochasticity and weak randomness

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

Volumn 1046, Issue , 1996, Pages 61-74

  Ambos Spies, Klaus ^a   Mayordomo, Elvira ^b   Wang, Yongge ^a   Zheng, Xizhong ^a  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERICITY; PREDICTION FUNCTION; RESOURCE-BOUNDED; RESOURCE-BOUNDED MEASURE; STOCHASTICITY; WEAK RANDOMNESS;

RANDOM PROCESSES;

EID: 84948145107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_6     Document Type: Conference Paper

References (19)

1. K. Ambos-Spies. Resource-bounded genericity. To appear in Computability, Enu-merability and Unsolvability: Directions in Recursion Theory (B. Cooper et al., Eds.), Cambridge University Press. Extended abstract in Proc. 10th Conf. on Structure in Complexity Theory, pages 162-181. IEEE Computer Society Press, 1995.
2. K. Ambos-Spies, H. Fleischhack, and H. Huwig. Diagonalizations over deterministic polynomial time. In Proc. of CSL 87, Lecture Notes in Comput. Sci. 329, pages 1-16. Springer Verlag, 1988.
3. K. Ambos-Spies, H.-C. Neis, and S. A. Terwijn. Genericity and measure for exponential time. Theoret. Comput. Sci. (to appear). Extended abstract in Proc. MFCS 94, Lecture Notes in Comput. Sci. 841, pages 221-232. Springer Verlag, 1994
4. K. Ambos-Spies, S. A. Terwijn, and X. Zheng. Resource-bounded randomness and weakly complete problems. Theoret. Comput. Sci. (to appear). Extended abstract in Proc. 5th ISAAC, Lecture Notes in Comput. Sci. 834, pages 369-377. Springer Verlag, 1994
5. J. L. Balcazar and E. Mayordomo. A note on genericity and bi-immunity. In Proc. 10th Conf. on Structure in Complexity Theory, pages 193-196. IEEE Computer Society Press, 1995.
6. A. Church. On the concept of a random sequence. Bull. Amer. Math. Soc., 45:130-135, 1940.
7. R. A. Di Paola. Random sets in subrecursive hierarchies. J. Assoc. Comput. Mach., 16:621-630, 1969.
8. S. A. Fenner. Notions of resource-bounded category and genericity. In Proc. 6th Conf. on Structure in Complexity Theory, pages 196-221. IEEE Computer Society Press, 1991.
9. S. A. Fenner. Resource-bounded Baire category: A stronger approach. In Proc. 10th Conf. on Structure in Complexity Theory, pages 182-192. IEEE Computer Society Press, 1995.
10. D. Juedes and J. H. Lutz. Weak completeness in E and EL. J. Theoret. Comput. Sci., 143:149-158, 1995.
11. K. Ko. On the notion of infinite pseudorandom sequences. Theoret. Comput. Sci., 48:9-33, 1986.
12. J. H. Lutz. Category and measure in complexity classes. SIAM J. Comput., 19:1100-1131, 1990.
13. J. H. Lutz. Almost everywhere high nonuniform complexity. J. Comput. and System Sci., 44:220-258, 1992.
14. E. Mayordomo. Contributions to the study of resource-bounded measure. PhD thesis, Barcelona, 1994.
15. C. P. Schnorr. Zufäüigkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeittheorie. Lecture Notes in Math. 21. Springer Verlag, 1971.
16. V. A. Uspenskii, A. L. Semenov, and A. Kh. Shen. Can an individual sequence of zeros and ones be random? Russian Math. Surveys, 45:121-189, 1990.
17. J. Ville. Etude Critique de la Notion de Collectif. Gauthiers-Villars, Paris, 1939.
18. R. von Mises. Grundlagen der Wahrscheinlichkeitsrechnung. Math. Z., 5:52-89, 1919.
19. R. Wilber. Randomness and the density of hard problems. In Proc. Z4th IEEE Symp. on Foundations of Computer Science, pages 335-342, 1983.