The Obidi Action and the Kolmogorov Complexity: From Information and Algorithmic Complexity to Entropy as a Universal Field

Conceptual Foundations

Kolmogorov Complexity (K):

1. Quantifies the informational content of a string as the length of the shortest program that outputs it on a universal Turing machine.
2. Captures absolute, pointwise randomness rather than ensemble averages; closely related to notions of algorithmic compressibility, incompressibility, and randomness certification.
3. Emerges as a limiting case of algorithmic information theory and forms the backbone of a formalized approach to object-level stochasticity.
4. Classical K is uncomputable in general, reflecting fundamental limits in predicting algorithmic patterns (Chaitin’s incompleteness theorem).
5. Time-bound variants (Kt, rKt, pKt) introduce resource sensitivity, linking descriptive complexity to computational efficiency or probabilistic generation (Refs: [4–8]).

Obidi Action (S_O):

1. Introduced in the Theory of Entropicity (ToE) as a unifying variational functional on an entropic manifold.
2. Encodes the full dynamical, geometric, and probabilistic information of physical systems via the Master Entropic Equation (MEE).
3. Operates over a continuous entropic field formalism, integrating classical thermodynamics, gravitational thermodynamics, and information-theoretic principles.
4. Generates emergent structures, e.g., probability calculus, Shannon entropy, Fisher–Rao metric, and Kolmogorov complexity as limiting discrete cases.
5. Serves as a generalization of the algorithmic description paradigm to a field-theoretic and geometric context, formalizing correlations and causal structure beyond computational sequences (Refs: [1–3]).

2. Mathematical Relationship and Limiting Behavior Between the Kolmogorov Complexity and the Obidi Action of the Theory of Entropicity (ToE)

From ToE formulations (Sections 12–15, Ref. [3]), the Obidi Action acts as a mother functional: upon suitable dimensional reduction and discretization, the extremal configurations of S_O yield the Kolmogorov complexity K(x) and its stochastic generalizations Kt(x),rKt(x),pKt(x). Symbolically:

K(x)∼limS_O​[ϕ]

This limit is not merely formal; it preserves the invariance, randomness certification, and information-theoretic bounds of Kolmogorov complexity, embedding them within a continuous, physically meaningful manifold.

3. Conceptual and Operational Distinctions of the Obidi Action and Kolmogorov Complexity

Kolmogorov Complexity:

1. Measures information at the individual object level.

2. Discrete, abstract, and computationally constrained.

3. Suited for compression, algorithmic randomness analysis, and foundational logic.

Obidi Action:

1. Encodes information at the field or system level, encompassing both computational and physical degrees of freedom.

2. Continuous, variational, and geometric; incorporates probabilistic and thermodynamic constraints.

3. Captures causality, entropic flow, and emergent spacetime notions.

Key Insight of KOL (Kolmogorov–Obidi Lineage):

1. K(x) is a substructure of S_O: algorithmic descriptions emerge from entropic variational principles.
2. The lineage tracks the evolution: Kolmogorov → Shannon → Bekenstein → Verlinde → Obidi.

This situates algorithmic information theory within a unified entropic-physical architecture, allowing a continuum-field perspective on discrete complexity measures.

4. Synthesis and Implications

1. Emergent Hierarchy: Obidi Action generalizes Kolmogorov Complexity, embedding it in a physically constrained, geometrical, and entropic framework.
2. Compatibility with Existing Theories: K(x), Shannon entropy, and Solomonoff–Levin algorithmic probability arise as limiting cases of Obidi Action, guaranteeing consistency with classical algorithmic information theory.
3. Novel Applications: Field-theoretic embedding allows analysis of entropic propagation, quantum entanglement constraints, and cosmological information structure, transcending purely computational constructs.
4. Practical Consequence: Whereas K(x) describes compressibility in isolation, Obidi Action governs compressibility under physical laws, integrating computation, energetic cost, and probabilistic causality.

References:

[1] Obidi, J.O. ToE Living Review Letters IC: The Alemoh–Obidi Correspondence, 2026.

[2] Obidi, J.O. Theory of Entropicity, Blog Archive, 2026.

[3] Obidi J.O., ToE-LRLS-LetterIC-The-Alemoh-Obidi-Correspondence-AOC-V1.md, GitHub (Main derivational reference).

[4] Li, M., Vitanyi, P. An Introduction to Kolmogorov Complexity and Its Applications, Springer, 2008.

[5] Wikipedia. Kolmogorov Complexity, 2026.

[6] CMU CS252, Lecture Notes on Kolmogorov Complexity, 2020.

[7] Oliveira et al., Time-Bounded Probabilistic Kolmogorov Complexity: A Survey, 2022.

[8] Vitanyi, P., Li, M., Kolmogorov Complexity and Its Applications in Computation, 2nd ed., 1997.

Summary Statement

The Obidi Action operates as a universal, continuous entropic functional from which Kolmogorov complexity and its time-bounded and probabilistic relatives emerge as discrete limiting cases. Within the Kolmogorov–Obidi Lineage (KOL), S_O extends the algorithmic notion of complexity into a field-theoretic, physically grounded framework, linking computational informational bounds to the entropic dynamics of the universe.

In essence, the Obidi Action subsumes Kolmogorov complexity: every principle, bound, and structure of K(x) exists within the broader, variational architecture of the ToE.