Grounding Occam's Razor in a Formal Theory of Simplicity
Ben Goertzel

TL;DR
This paper develops a formal theory of simplicity based on symmetry properties, extending traditional measures to a combinational model, and reinterprets Occam's Razor as favoring Pareto-optimal simplicity bundles in complex systems.
Contribution
It introduces a new formal framework for understanding simplicity through Compositional Simplicity Measures and their operating sets, extending traditional algorithmic information concepts.
Findings
Defines CoSM and CoSMOS as generalized simplicity measures.
Establishes Pareto-optimality as a criterion for hypothesis selection.
Formalizes the concept of coherent dual networks in systems of patterns.
Abstract
A formal theory of simplicity is introduced, in the context of a "combinational" computation model that views computation as comprising the iterated transformational and compositional activity of a population of agents upon each other. Conventional measures of simplicity in terms of algorithmic information etc. are shown to be special cases of a broader understanding of the core "symmetry" properties constituting what is defined here as a Compositional Simplicity Measure (CoSM). This theory of CoSMs is extended to a theory of CoSMOS (Combinational Simplicity Measure Operating Sets) which involve multiple simplicity measures utilized together. Given a vector of simplicity measures, an entity is associated not with an individual simplicity value but with a "simplicity bundles" of Pareto-optimal simplicity-value vectors. CoSMs and CoSMOS are then used as a foundation for a theory of…
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 · Logic, Reasoning, and Knowledge · Cognitive Science and Mapping
