Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Computer Science;K. Ambos-Spies,1996
2. Asarin, E.: Some properties of Kolmogorov Δ-random sequences. Theory Probab. Appl. 32, 507–508 (1987)
3. Downey, R., Hirschfeldt, D.: Algorithmic Randomness and complexity. Book in preparation
4. Lecture Notes in Computer Science;R. Downey,2005
5. Durand, B., Vereshchagin, N.: Kolmogorov-Loveland stochasticity for finite strings. Information Processing Letters 91(6), 263–269 (2004)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS;Probability in the Engineering and Informational Sciences;2018-12-05
2. An empirical study of the complexity and randomness of prediction error sequences;Communications in Nonlinear Science and Numerical Simulation;2011-07