TL;DR
This paper explores the limits of modeling complex systems, distinguishing between decidable and undecidable dynamics, and introduces the concept of G-complexity as a threshold for modeling feasibility.
Contribution
It proposes a theoretical framework based on G-complexity to differentiate between what can be fully modeled and what remains inherently partial or undecidable.
Findings
Models are sufficient below the G-complexity threshold.
Above the threshold, complete modeling becomes impossible.
The threshold defines the boundary of decidability in complex systems.
Abstract
To model is to represent. The threshold of decidability defines two epistemological choices: one model (or a finite number of models) suffices for representing the dynamics below the undecidable; above this threshold (defined as G-complexity), every model is partial, no complete modeling is possible.
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