Metraipolis › archive › dc_e0039bbdf0e5

Synergetic Autonomous Intelligence: Three Axioms for Recursive Semi-Closed Learning — arXiv:2611.01070

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01070
License (as archived)
CC0-1.0
Archived
2026-11-03T11:20:54.301Z
SHA-256 of the archived text
eec6e42b68e2a8f262aba0b4a94b639cff0696e95d12efd3e80cf5166de5982a
Stable URL of this page
https://metraipolis.com/documento/dc_e0039bbdf0e5

How to cite

Synergetic Autonomous Intelligence: Three Axioms for Recursive Semi-Closed Learning — arXiv:2611.01070 — arXiv (en), https://arxiv.org/abs/2611.01070 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e0039bbdf0e5 (Metraipolis archive dc_e0039bbdf0e5, sha256 eec6e42b68e2a8f262aba0b4a94b639cff0696e95d12efd3e80cf5166de5982a)
BibTeX
@misc{dce0039bbdf0e5,
  title = {Synergetic Autonomous Intelligence: Three Axioms for Recursive Semi-Closed Learning — arXiv:2611.01070},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01070},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e0039bbdf0e5; sha256 eec6e42b68e2a8f262aba0b4a94b639cff0696e95d12efd3e80cf5166de5982a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01070. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We introduce Synergetic Autonomous Intelligence (SAI), a theory and design program for learning systems that form, preserve, revise, and compose relations while continuing to learn. SAI is built on three axioms: consequential distinctions must not become orphaned (U); identity is determined by future-faithful continuation under a declared contract (I); and unresolved defects are repaired by the least lawful local completion at the lowest admitted grade (L). We model a model, agent, tool, team, or environment boundary as a recursive semi-closed system with a Kernel-Ring representation, a Compile-Open-Participate cycle, and a typed residual comparing actual with claimed continuation. Under explicit finite or affine contracts, we establish relative consistency and conditional non-redundancy of U/I/L, characterize a contract-relative semantic quotient, construct an exact joint stochastic refinement, derive a constrained residual contraction, prove finite-horizon continued-service viability, and give an executed-intervention identification result with an observational-confounding boundary. We define GRC-Close as the generative and repair schema for this contract. The framework also gives finite contracts for action-effect-feedback loop re-entry, partial failure, duplicate-effect idempotency, replay, concurrent delivery, causal uncertainty, and threshold-radix state representation. KREIT, the Kernel-Ring Equilibrium Information Theory layer, treats information as a typed, resource-bounded distinction; the control layer authorizes, executes, audits, and updates actions across cloud-edge-end scales. These results establish a common contract-level vocabulary for representation, relation, memory, action, communication, explanation, coordination, and growth, while marking the assumptions and open boundaries required for later generalization.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.01070 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:02:37.497Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).