Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations.
Weakness is All You Need: Notes on Quantale Weakness as a Unifying Generalized- Occam Principle for Cognitive Science and AGI
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations.