Decomposition of Kolmogorov Complexity And Link To Geometry
Dara O Shayda

TL;DR
This paper explores the connection between Kolmogorov Complexity and geometry, introducing a decomposition method and applying it to analyze the geometry of Light Cone using computational approximations.
Contribution
It presents a novel approach linking Kolmogorov Complexity with geometric concepts through projection and decomposition methods, supported by computational testing.
Findings
Established a theoretical link between Kolmogorov Complexity and geometry.
Developed formulas for complexity decomposition and projection.
Applied the approach to study Light Cone geometry.
Abstract
A link between Kolmogorov Complexity and geometry is uncovered. A similar concept of projection and vector decomposition is described for Kolmogorov Complexity. By using a simple approximation to the Kolmogorov Complexity, coded in Mathematica, the derived formulas are tested and used to study the geometry of Light Cone.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Topological and Geometric Data Analysis · Advanced Topology and Set Theory
