2001/02/23 by Lane A. Hemaspaandra, Hemaspaandra, Lane A., Harald Hempel⋆ +2
Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #F.1.1 #F.1.2 #F.1.3 #FOS: Computer and information sciences #cs.CC #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0102024
11 pages
arxiv created 2001/02/23 · openalex publication_date 2001/02/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
No P-immune set having exponential gaps is positive-Turing self-reducible.