P-Immune Sets with Holes Lack Self-Reducibility Properties

TL;DR

This paper demonstrates that P-immune sets with exponential gaps do not possess positive-Turing self-reducibility, highlighting limitations in their computational structure.

Contribution

It establishes a new limitation on P-immune sets with exponential gaps, showing they lack certain self-reducibility properties.

Findings

P-immune sets with exponential gaps are not positive-Turing self-reducible.

The result clarifies the structural complexity of P-immune sets.

This advances understanding of the limitations of self-reducibility in complexity theory.

Abstract

No P-immune set having exponential gaps is positive-Turing self-reducible.