PGS

“The future of software engineering isn’t about replacing programmers. It’s about separating business behavior from software implementation.” Every week brings another AI coding breakthrough Claude writes production code. Cursor refactors entire repositories. GitHub Copilot completes functions before we finish typing. OpenAI, Anthropic and Google continue pushing software generation toward astonishing levels. The question dominating our industry has become: “How soon will AI write all software?” I believe that’s the wrong question. ...

“The future of software engineering is not about humans writing more code. It is about humans governing what software is allowed to do.” AI has changed the software equation. Something fundamental is happening in software engineering. AI coding systems can now generate applications, refactor repositories, explain architectures, and produce implementations at a speed that was unimaginable only a few years ago. The question dominating the industry has been: “How soon will AI write all software?” ...

The new millennium entered adolescence after the Dotcom Bust, followed by waves of Cloud Computing, Mobile/Social Networking, and now, the AI boom. Each wave followed roughly a ten-year cycle, and the next one is already written on the wall in invisible ink, if you only connect the dots. The next great IT wave may not be CapEx-rich Quantum Computing. It may have to be some OpEx-rich wave, perhaps Software Engineering?. That is if you believe AI will survive and thrive unlike Dotcom bust. ...

The first open draft of the Protocol-Governed Computing (PGC) Standard is now available for public scrutiny. It is an attempt to address a problem that becomes increasingly expensive as business software grows older: how to preserve the governing meaning of a system while allowing its implementation to change. That picture is the whole idea in one frame. On the left, the governed meaning of a system: stable, explicit, written down. On the right, every language and runtime anyone might choose to realize it in. The protocol is the bridge, and it is deliberately narrow — it says what must be true, and says nothing about which road you take to make it true. ...

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. ...