Computation Precedes Naming: Naming Returns Computation
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.Abstract
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.
Fields of Study & Subjects
Logic
programming
and type systems
Computability
AI Algorithms
semigroups and automata theory
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 28 March 2026
- Language
- EN
- Document type
- Preprint