Resource bounded randomness and weakly complete problems

K Ambos-Spies, SA Terwijn, Z Xizhong - Theoretical Computer Science, 1997 - Elsevier
We introduce and study resource bounded random sets based on Lutz's concept of resource
bounded measure [7, 8]. We concentrate on nc-randomness (c⩾ 2) which corresponds to the
polynomial time bounded (p-) measure of Lutz, and which is adequate for studying the
internal and quantitative structure of E= DTIME (2 lin). However, we will also comment on E
2= DTIME (2 pol) and its corresponding (p2-) measure. First we show that the class of nc-
random sets has p-measure 1. This provides a new, simplified approach to p-measure 1 …

Resource bounded randomness and weakly complete problems

K Ambos-Spies, SA Terwijn, Z Xizhong - … '94 Beijing, PR China, August 25 …, 1994 - Springer
We introduce and study resource bounded random sets based on Lutz's concept of resource
bounded measure ([5, 6]). We concentrate on n c-randomness (c≥ 2) which corresponds to
the polynomial time bounded (p-) measure of Lutz, and which is adequate for studying the
internal and quantative structure of E= DTIME (2lin). First we show that the class of n c-
random sets has p-measure 1. This provides a new, simplified approach to p-measure 1-
results. Next we compare randomness with genericity (in the sense of [1, 2]) and we show …
Showing the best results for this search. See all results