Cargando…
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...
Autores principales: | Zenil, Hector, Kiani, Narsis A., Tegnér, Jesper |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7513059/ https://www.ncbi.nlm.nih.gov/pubmed/33265623 http://dx.doi.org/10.3390/e20070534 |
Ejemplares similares
-
A Review of Graph and Network Complexity from an Algorithmic Information Perspective
por: Zenil, Hector, et al.
Publicado: (2018) -
The Thermodynamics of Network Coding, and an Algorithmic Refinement of the Principle of Maximum Entropy †
por: Zenil, Hector, et al.
Publicado: (2019) -
A Decomposition Method for Global Evaluation of Shannon Entropy and Local Estimations of Algorithmic Complexity
por: Zenil, Hector, et al.
Publicado: (2018) -
Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces
por: Hernández-Orozco, Santiago, et al.
Publicado: (2021) -
An Algorithmic Information Calculus for Causal Discovery and Reprogramming Systems
por: Zenil, Hector, et al.
Publicado: (2019)