Resource bounded randomness and computational complexity
نویسندگان
چکیده
منابع مشابه
Resource bounded randomness and computational complexity
The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is independent of the notions of polynomial time bounded Lutz, Schnorr and Kurtz randomness. Lutz has conje...
متن کاملResource-Bounded Measure and Randomness
Supported by the Human Capital and Mobility Program of the European Community under grant CHRX-CT93-0415 (COLORET). Mathematisches Institut, Universit at Heidelberg, D-69120 Heidelberg, Germany Universidad de Zaragoza, Dept. Inform atica, CPS, Mar a del Luna 3, E-50015 Zaragoza, Spain We survey recent results on resource-bounded measure and randomness in structural complexity theory. In partic...
متن کاملDemuth randomness and computational complexity
Demuth tests generalize Martin-Löf tests (Gm)m∈N in that one can exchange the m-th component for a computably bounded number of times. A set Z ⊆ N fails a Demuth test if Z is in infinitely many final versions of the Gm. If we only allow Demuth tests such that Gm ⊇ Gm+1 for each m, we have weak Demuth randomness. We show that a weakly Demuth random set can be high, yet not superhigh. Next, any c...
متن کاملRandomness - A Computational Complexity Perspective
Man has grappled with the meaning and utility of randomness for centuries. Research in the Theory of Computation in the last thirty years has enriched this study considerably. This lecture will describe two main aspects of this research on randomness, demonstrating its power and weakness respectively. Randomness is paramount to computational efficiency: The use of randomness seems to dramatical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00119-4