P-Selectivity, Immunity, and the Power of One Bit

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is not EXP/1-immune. That is, we prove that some infinite P-selective set has no infinite EXP-time subset, but we also prove that every infinite P-selective set has some infinite subset in EXP/1. Informally put, the immunity of P-sel is so fragile that it is pierced by a single bit of information. The above claims follow from broader results that we obtain about the immunity of the P-selective sets. In particular, we prove that for every recursive function f, P-sel is DTIME(f)-immune. Yet we also prove that P-sel is not Π_2^p/1-immune.

Keywords

Computational Complexity, F.1.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/100633

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0504096
 http://arxiv.org/abs/cs/0504096

Collections

arXiv