Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao ZENODOarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
ZENODO
Report . 2026
License: CC BY NC ND
Data sources: ZENODO
ZENODO
Report . 2026
License: CC BY NC ND
Data sources: Datacite
ZENODO
Report . 2026
License: CC BY NC ND
Data sources: Datacite
versions View all 2 versions
addClaim

Invariant-Grounded Computation (IGC)

Authors: Jaspers, Koen;

Invariant-Grounded Computation (IGC)

Abstract

This paper introduces Invariant-Grounded Computation (IGC), a foundational computational paradigm in which safety, coherence, and bounded behavior are enforced at the earliest possible stages of execution: compilation and loading. Rather than treating safety as a policy or supervisory layer added after execution begins, IGC encodes invariants directly into the ontological gates that determine what programs may exist and how they may instantiate.Drawing inspiration from fungal intelligence—distributed, non-agentic, and invariant-preserving biological systems—we formalize a model in which compilers and loaders function as coherence filters rather than mere translation tools. This approach prevents unsafe computational forms from ever instantiating, eliminating entire classes of escalation, goal drift, and runaway behavior by construction. Implementation details are intentionally omitted.

Keywords

invariant-grounded computation, fungal intelligence, compiler theory, loaders, AI safety, non-agentic systems, dissipative computation

  • BIP!
    Impact byBIP!
    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
Powered by OpenAIRE graph
Found an issue? Give us feedback
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).
BIP!Citations provided by BIP!
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.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!