TL;DR
This paper introduces a hierarchical coding approach to quantify the information content of objects, making the computation of their complexity more practical and related to the class size rather than individual length.
Contribution
It proposes a novel hierarchical coding method that simplifies the computation of algorithmic complexity by relating it to class size instead of object length.
Findings
Hierarchical coding enables easier computation of complex objects.
Complexity relates to class size, not object length.
Practical examples demonstrate the method's effectiveness.
Abstract
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex objects. Our algorithmic complexity is related to the length of the class of objects, rather than to the length of the object.
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.