
Structural nonclosure on the classical computation carrier (binary strings with drop/prepend). Three independent machine-checked proofs that the section does not close: no structure-preserving map from the frictionless model (fold_unfold_nonclosure, six lines, omega); selfApp not equal to identity (presemantic_not_group_C); irreducible factoring through header length (classicalGRM_factorsThrough). P and NP are defined on this carrier (rfl). The nonclosure constrains them. Formalized in Lean 4 with Mathlib v4.28.0. Zero sorry, zero custom axioms.
computational complexity, carrier geometry, WeakReflData, selfApp, nonclosure, retraction
computational complexity, carrier geometry, WeakReflData, selfApp, nonclosure, retraction
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
