Abstract
A formal notion of diagonalization is developed which allows to enforce properties that are related to the class of polynomial time computable sets (the class of polynomial time computable functions respectively), like, e.g., p-immunity. It is shown that there are sets—called p-generic— which have all properties enforceable by such diagonalizations. We study the behaviour and the complexity of p-generic sets. In particular, we show that the existence of p-generic sets in NP is oracle dependent, even if we assume P ≠ NP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.