Resource-bounded balanced genericity, stochasticity and weak randomness
From MaRDI portal
Publication:4593918
DOI10.1007/3-540-60922-9_6zbMath1379.68185OpenAlexW1583050963MaRDI QIDQ4593918
Zheng, Xizhong, Elvira Mayordomo, Yongge Wang, Ambos-Spies, Klaus
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_6
Related Items (11)
On unstable and unoptimal prediction ⋮ Immunity and pseudorandomness of context-free languages ⋮ Computability theory. Abstracts from the workshop held January 7--13, 2018 ⋮ The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences ⋮ The complexity of stochastic sequences ⋮ Kolmogorov-Loveland stochasticity and Kolmogorov complexity ⋮ Genericity and randomness over feasible probability measures ⋮ Resource bounded randomness and computational complexity ⋮ Kolmogorov-Loveland randomness and stochasticity ⋮ Resource-bounded martingales and computable Dowd-type generic sets ⋮ Simple betting and stochasticity
This page was built for publication: Resource-bounded balanced genericity, stochasticity and weak randomness
