Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs. We review, study and apply a method for approximating the algorithmic complexity (al...
Main Authors: | Hector Zenil, Narsis A. Kiani, Jesper Tegnér |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-07-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/7/534 |
Similar Items
-
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
by: Hector Zenil, et al.
Published: (2018-07-01) -
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
by: Hector Zenil, et al.
Published: (2018-08-01) -
Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environments
by: David A. Rosenblueth, et al.
Published: (2012-11-01) -
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
by: Hector Zenil, et al.
Published: (2015-09-01) -
Towards Demystifying Shannon Entropy, Lossless Compression and Approaches to Statistical Machine Learning
by: Hector Zenil
Published: (2020-06-01)