A note on genericity and bi-immunity

Authors:
J. L. Balcazar;E. Mayordomo
Affiliations:
-;-
Venue:
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Year:
1995

Citing 0
Cited 7

Category, Measure, Inductive Inference: A Triality Theorem and Its Applications

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Resource bounded immunity and simplicity

Theoretical Computer Science
Autoreducibility, mitoticity, and immunity

Journal of Computer and System Sciences
Non-mitotic sets

Theoretical Computer Science
Non-mitotic sets

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Autoreducibility, mitoticity, and immunity

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A thirty year old conjecture about promise problems

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generic sets have all properties (from among a suitably chosen class) that can be enforced by finite extension arguments. In particular, p-generic sets known to be P-bi-immune. We try to clarify the precise relationship between genericity and bi-immunity by proposing an extended notion of bi-immunity that exactly characterizes the p-generic sets.