Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations

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...

Full description

Bibliographic Details
Main Authors: Hector Zenil, Narsis A. Kiani, Jesper Tegnér
Format: Article
Language:English
Published: MDPI AG 2018-07-01
Series:Entropy
Subjects:
Kolmogorov–Chaitin complexity
algorithmic probability
algorithmic coding theorem
Turing machines
polyominoes
polyhedral networks
molecular complexity
polytopes
information content
Shannon entropy
symmetry breaking
recursive transformation
Online Access:http://www.mdpi.com/1099-4300/20/7/534

Internet

http://www.mdpi.com/1099-4300/20/7/534

Similar Items