The complexity of stochastic sequences
From MaRDI portal
Publication:2475407
DOI10.1016/j.jcss.2007.06.018zbMath1133.68030MaRDI QIDQ2475407
Publication date: 11 March 2008
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.018
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Cites Work
- Mathematical metaphysics of randomness
- Classical recursion theory. Vol. II
- Recursive computational depth.
- Minimal-program complexity of pseudo-recursive and pseudo-random sequences
- Resource-bounded balanced genericity, stochasticity and weak randomness
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- A New Interpretation of the von Mises' Concept of Random Sequence
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item