Superseded — DOI-Published, Replaced by Current Papers

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Software Architecture Keywords: software architecture, declarative systems, deterministic execution, protocol governance, AI-generated code, auditability, separation of concerns, constitutional primitives, architectural layers, behavioral concerns ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Computational Complexity (cs.CC) Keywords: Turing completeness, universal computation, protocol governance, declarative systems, constitutional architecture, deterministic execution, auditability, AI-era software Introduction Motivation: Why Turing Completeness Is No Longer Enough The theory of computation has long celebrated Turing completeness as the definitive measure of computational power. A system is deemed “complete” if it can simulate any Turing machine—if it can compute any function that is computable in principle . This criterion, established nearly a century ago, remains the benchmark against which programming languages, virtual machines, and computational models are evaluated. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the structural core of protocol-governed systems through a constitutional taxonomy based on two orthogonal primitives: layers and concerns. Prior work established the separation between behavioral specification and execution mechanics [Bachi, 2026a] and demonstrated that constitutional constraint is compatible with universal computation [Bachi, 2026b]. This paper isolates the structural grammar that makes such governance enforceable. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the governance mechanics of protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c], it specifies how behavioral law is proposed, validated, ratified, versioned, and amended. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the semantics of protocol artifacts in protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c] and the governance lifecycle established in Paper 4 [Bachi, 2026d], it specifies how behavioral law is represented in ratified protocol artifacts. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the execution mechanics of protocol-governed systems. Building on the protocol specification model defined in Paper 5 [Bachi, 2026e], it specifies how ratified behavioral law is deterministically enforced at runtime. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the architectural separation between pure computation and governed mutation in protocol-governed systems. Building on the execution model defined in Paper 6 [Bachi, 2026f], it specifies the semantic boundary between Capability Transforms (CT_) and Capability Side Effects (CS_). ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper analyzes the security properties that emerge structurally from protocol-governed architecture. Building on the deterministic enforcement model (Paper 6) [Bachi, 2026f] and the computation-mutation separation (Paper 7) [Bachi, 2026g], we demonstrate that protocol governance inverts conventional trust assumptions. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper analyzes the lifecycle, complexity, and implementation economics of protocol-governed architecture. Building on the structural taxonomy (Paper 3) [Bachi, 2026c], governance mechanics (Paper 4) [Bachi, 2026d], deterministic enforcement (Paper 6) [Bachi, 2026f], and mutation bounding (Paper 7) [Bachi, 2026g], we model how constitutional separation affects long-term system evolution, incremental domain implementation cost, and human cognitive scaling. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract The increasing adoption of generative artificial intelligence (AI) in software development introduces a structural asymmetry: implementation generation now occurs at machine speed, while behavioral governance remains constrained by institutional deliberation. These processes are not merely mismatched in velocity; they are orthogonal in function. Generation produces executable artifacts. Governance establishes permissible behavior. ...