Resource bounded immunity and simplicity
نویسندگان
چکیده
منابع مشابه
Resource Bounded Immunity and Simplicity
Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we investigate the structural characteristics of various immunity notions: strong immunity, almost immunity, and hyperimmunity as well as their corresponding simplicity notions. We also study limited immunity and simplicity, called k-immunity and feasible k-immunity, and their simplicity notions. Finally, we pr...
متن کاملSimplicity, Immunity, Relativizations and Nondeterminism
The relation between classes of languages recognized by resource bounded Turing machines remains an evasive subject in computational complexity theory. Especially results settling relationship between deterministic and nondeterministic complexity classes are rare. The interesting case of the relation between the classes of languages recognized by polynomial time bounded deterministic versus pol...
متن کاملar X iv : c s . C C / 0 40 70 15 v 2 2 9 Ju n 20 05 Resource Bounded Immunity and Simplicity ∗
Revisiting the thirty years-old notions of resource-bounded immunity and simplicity, we investigate the structural characteristics of various immunity notions: strong immunity, almost immunity, and hyperimmunity as well as their corresponding simplicity notions. We also study limited immunity and simplicity, called k-immunity and feasible k-immunity, and their simplicity notions. Finally, we pr...
متن کاملBounded Immunity and Btt-Reductions
We define and study a new notion called k-immunity that lies between immunity and hyperimmunity in strength. Our interest in k-immunity is justified by the result that ∅ does not k-tt reduce to a k-immune set, which improves a previous result by Kobzev [7, 13]. We apply the result to show that ∅ does not btt-reduce to MIN, the set of minimal programs. Other applications include the set of Kolmo...
متن کاملResource-bounded strong dimension versus resource-bounded category
Classically it is known that any set with packing dimension less than 1 is meager in the sense of Baire category. We establish a resource-bounded extension: if a class X has ∆-strong dimension less than 1, then X is ∆-meager. This has the applications of explaining some of Lutz’s simultaneous ∆-meager, ∆-measure 0 results and providing a new proof of a Gu’s strong dimension result on infinitely...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.03.055