Published March 18, 2026 | Version v1.0
Preprint Restricted

The Constant-Dalink Incompleteness Formula: Cognitive Foundations and Dual Completeness in GSS

Authors/Creators

  • 1. Independent Researcher

Description

Chinese Title: Constant-Dalink 不完备公式:GSS 的认知基础与对偶完备性

Declaration: 理论均由账号主所发,权益为账号主负责。

Abstract: This paper introduces the "Constant-Dalink Incompleteness Formula" as the cognitive foundation for the GSS-OS architecture, alongside the theoretical framework of "Dual Completeness". First, the Constant-Dalink formula formalizes the principle that for any finite cognitive system executing a specific task, the actually activated knowledge (V_use) is always a strictly minimal subset of the entire knowledge space. This provides a mathematical basis for minimizing AI cognitive load through structural context compression, challenging the mainstream paradigm of massive context windows. Second, building upon this cognitive lower bound, the paper proposes the theory of "Dual Completeness" to balance capability expansion and cognitive overload. The system simultaneously satisfies the upper bound of Turing Completeness (achieving infinite functional extensibility via the core instruction set and HOW-code protocol) and the lower bound of Constant-Dalink Incompleteness (capping the runtime context at a constant level, approx. 150 tokens). This work establishes a unified theoretical boundary for highly efficient, Edge-AI-driven agent architectures.

Files

Restricted

The record is publicly accessible, but files are restricted. Log in to check if you have access.

Additional details

References

  • Turing, A. M. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 1936.
  • Gödel, K. On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Monatshefte für Mathematik und Physik, 1931.
  • Shannon, C. E. A Mathematical Theory of Communication. Bell System Technical Journal, 1948.
  • Tishby, N., Pereira, F. C., and Bialek, W. The Information Bottleneck Method. Proceedings of the 37th Annual Allerton Conference on Communication, Control, and Computing, 1999.
  • Brown, T. B. et al. Language Models are Few-Shot Learners. NeurIPS, 2020.
  • Liu, N. F. et al. Lost in the Middle: How Language Models Use Long Contexts. Transactions of the Association for Computational Linguistics, 2024.